R. P. Lewis, The number of spanning trees of a complete multipartite graph, Discrete Mathematics, 197/198 (1999), 537 - 541.R.P. Lewis, The number of spanning trees of a complete multipartite graph. Discrete Math.R. P. Lewis, The number of spanning trees of a complete multipartite ...
On the number of rainbow spanning trees in edge-colored complete graphs A spanning tree of a properly edge-colored complete graph, K, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Ho... Fu, Hung-LinLo, Yuan-HsunPerry, K. E.Rodger, C. A...
The number of spanning trees of a graph with given matching number. Feng, Lihua,Xu, Kexiang,Das, Kinkar Ch,... - Computing Methods in Applied Sciences & Engineering - 1973 - 被引量: 0 On the number of a ...
GraphTheory CliqueNumber compute clique number of graph MaximumClique find maximum clique in graph Calling Sequence Parameters Options Description Examples References Compatibility Calling Sequence CliqueNumber( G ) CliqueNumber( G , opt ) MaximumClique(
An exclusive expression tau(W-n) = 3 tau(F-n) - 2 tau(Fn-1) - 2 for determining number of spanning trees of wheel graph W-n and a recurrence relation tau(W-n) = 3 tau(Wn-1) - tau(Wn-2) + 2 are derived by expressing tau(W-n) into disjoint sets and expressing cardinality...
Let t ( G ) be the number of spanning trees of a connected graph G , and let b ( G ) be the number of bases of the bicircular matroid B ( G ). In this paper we obtain bounds relating b ( G ) and t ( G ), and study in detail the case where G is a complete graph K...
on the number of examples and stages needed for learning decision treesimension. It follows that the number of examples needed for learning r-DTn can be determined modulo HU Simon 被引量: 5发表: 1990年 On the Coalition Number of Trees Let G be a graph with vertex set V and of ordern...
We study a competitive optimization version of α′(G), the maximum size of a matching in a graph G. Players alternate adding edges of G to a matching until it becomes a maximal matching. One player (Max) wants the final matching to be large; the other (Min) wants it to be small....
1574-maximum-product-of-two-elements-in-an-array 1604-least-number-of-unique-integers-after-k-removals 1605-minimum-number-of-days-to-make-m-bouquets 1613-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree 1615-range-sum-of-sorted-subarray-sums 1616-minimum-difference-betwee...
1574-maximum-product-of-two-elements-in-an-array 1604-least-number-of-unique-integers-after-k-removals 1605-minimum-number-of-days-to-make-m-bouquets 1613-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree 1615-range-sum-of-sorted-subarray-sums 1616-minimum-difference-between-larges...