The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph. Known results towards the resolution of the conjectures are...
We show that a k‐edge‐connected graph on n vertices has at least n(k/2)n−1 spanningtrees. This bound is tight if k is even and the... S.,Ok,C.,... - 《Journal of Graph Theory》 被引量: 2发表: 2016年 A Bound on the Number of Spanning Trees in Bipartite Graphs Richard...
Enumeration of the bases of the bicircular matroid on a complete bipartite graph The structure of bases of the bicircular matroid in relation to the bases of the cycle matroid is explored. The techniques herein may enable the enumeration of the bases of bicircular matroids on larger classes of...
An (r, s)-tree is a connected, acyclic, bipartite graph withr light ands dark vertices. Uniform probability is assigned to the space,J.,H.,ChoE.,... - 《Graphs & Combinatorics》 被引量: 6发表: 1996年 Maximizing the Number of Spanning Trees in a Connected Graph We study the problem...
For non-bipartite $H$, the answer to ... R Morris,D Saxton - 《W3.impa.br》 被引量: 37发表: 2015年 Trees with a given order and matching number that have maximum general Randic index The general Randic index R(alpha) (G) of a graph G is defined by R(alpha) (G) = Sigma(uv...
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(
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph 1437-minimum-insertion-steps-to-make-a-string-palindrome 1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance 1457-minimum-difficulty-of-a-job-schedule 1458-sort-integers-by-the-number-of-1-bits 1459...
It is shown that for n≥141, among all triangle-free graphs on n vertices, the balanced complete bipartite graph K⌈n/2⌉,⌊n/2⌋ is the unique triangle-free graph with the maximum number of cycles. Using modified Bessel functions, tight estimates are given for the number of cycles...
Three years of research onEurygaster integricepsPut., and other Pentatomoids associated with cultivated cereals in Middle East countries, covered many aspe... ES Brown - 《Bulletin of Entomological Research》 被引量: 12发表: 1962年 On the generation of bipartite grids with controlled regularity ...
Binary tree is a special kind of tree where each node has a maximum of two children. The topmost node in the tree is called 'root' node. The left reference of the root node is called the 'left child' while the right reference is called the 'right child' of the ...