A certain polynomial of a graph and graphs with an extremal number of trees
From MaRDI portal
Publication:1393403
DOI10.1016/0095-8956(74)90065-3zbMath0277.05104OpenAlexW1987430956MaRDI QIDQ1393403
V. M. Chelnokov, Alexander K. Kelmans
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(74)90065-3
Related Items (91)
The number of spanning trees in a new lexicographic product of graphs ⋮ The number of rooted forests in circulant graphs ⋮ Graphs whose spectrum determined by non-constant coefficients ⋮ On the spectral characterizations of graphs ⋮ On the normalized Laplacian spectral radii of a graph and its line graph ⋮ On graphs with randomly deleted edges ⋮ A special class of triple starlike trees characterized by Laplacian spectrum ⋮ Nonisomorphic graphs with the same t-polynomial ⋮ On the Number of All Substructures Containing at Most Four Edges ⋮ Some graphs determined by their spectra ⋮ On family of graphs with minimum number of spanning trees ⋮ Weighted complexities of graph products and bundles ⋮ Spanning tree formulas and Chebyshev polynomials ⋮ Schur convex functions on the spectra of graphs ⋮ Laplacian spectra and spanning trees of threshold graphs ⋮ On the characterization of graphs with maximum number of spanning trees ⋮ Extremal graphs for the Tutte polynomial ⋮ Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph ⋮ Complexity of graphs generated by wheel graph and their asymptotic limits ⋮ Hearing shapes viap-adic Laplacians ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Polynomial graph invariants and the KP hierarchy ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications ⋮ On the spectral characterization of some unicyclic graphs ⋮ A generalization of Boesch's theorem ⋮ A flow in the forest ⋮ Enumeration of spanning trees in prisms of some graphs ⋮ Ordering connected graphs by their Kirchhoff indices ⋮ On the Jacobian group of a cone over a circulant graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ On the signless Laplacian coefficients of unicyclic graphs ⋮ On the Laplacian coefficients of graphs under some transformations ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices ⋮ Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory ⋮ Tree counting polynomials for labelled graphs. I: Properties ⋮ Laplacian spectral characterization of some graph products ⋮ Some results on signless Laplacian coefficients of graphs ⋮ D-optimal block designs with at most six varieties ⋮ Spanning trees and even integer eigenvalues of graphs ⋮ Laplacian spectra of digraph transformations ⋮ The number of spanning trees in the composition graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Spectral characterizations of lollipop graphs ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ On the complexity of a class of pyramid graphs and Chebyshev polynomials ⋮ Maximal determinant knots ⋮ The multi-fan graphs are determined by their Laplacian spectra ⋮ Network reliability in Hamiltonian graphs ⋮ The Laplacian permanental polynomial for trees ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ Spanning trees of extended graphs ⋮ Determination of double quasi-star tree from its Laplacian spectrum ⋮ Число Деревьев Графа, Содержащих Заднный Лес ⋮ On the Laplacian coefficients of unicyclic graphs with prescribed matching number ⋮ On the Laplacian coefficients of tricyclic graphs ⋮ Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum ⋮ Laplace spectra of orgraphs and their applications ⋮ Ordering of trees with fixed matching number by the Laplacian coefficients ⋮ Asymptotic normality of Laplacian coefficients of graphs ⋮ On the spectra of nonsymmetric Laplacian matrices ⋮ Which wheel graphs are determined by their Laplacian spectra? ⋮ On the Laplacian coefficients of bicyclic graphs ⋮ Comparison of graphs by their number of spanning trees ⋮ A survey of some network reliability analysis and synthesis results ⋮ Nonisomorphic trees with the same T-polynomial ⋮ On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs ⋮ A linear algorithm for obtaining the Laplacian eigenvalues of a cograph ⋮ On the structure of Laplacian characteristic polynomial of circulant graphs ⋮ Connected graphs with a minimal number of spanning trees ⋮ Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs ⋮ When (signless) Laplacian coefficients meet matchings of subdivision ⋮ On the Laplacian coefficients of unicyclic graphs ⋮ Laplacian spectrum of weakly quasi-threshold graphs ⋮ One special double starlike graph is determined by its Laplacian spectrum ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ Spectral characterizations of sandglass graphs ⋮ Chordal 2‐Connected Graphs and Spanning Trees ⋮ Number of spanning trees in the sequence of some graphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ On the distribution of eigenvalues of graphs ⋮ On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels ⋮ The complexity of some classes of pyramid graphs created from a gear graph ⋮ On generic forms of complementary graphs ⋮ Forest matrices around the Laplacian matrix ⋮ Spanning trees of descendants of a complete graph ⋮ Laplacian matrices of graphs: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- Formulas for the number of trees in certain incomplete graphs
- Generating formulas for the number of trees in a graph
- The identification of an incompletely partitioned network
- A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
- Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
This page was built for publication: A certain polynomial of a graph and graphs with an extremal number of trees
