A certain polynomial of a graph and graphs with an extremal number of trees

Cites work

scientific article; zbMATH DE number 3126031 (Why is no real title available?)
scientific article; zbMATH DE number 3523603 (Why is no real title available?)
scientific article; zbMATH DE number 3294292 (Why is no real title available?)
scientific article; zbMATH DE number 3311772 (Why is no real title available?)
scientific article; zbMATH DE number 3324508 (Why is no real title available?)
scientific article; zbMATH DE number 3200675 (Why is no real title available?)
A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
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
Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

Cited in

(91)

Spectral characterizations of sandglass graphs
Nonisomorphic graphs with the same t-polynomial
Chordal 2-connected graphs and spanning trees
Network reliability in Hamiltonian graphs
Nonisomorphic trees with the same T-polynomial
On the normalized Laplacian spectral radii of a graph and its line graph
Polynomial graph invariants and the KP hierarchy
Laplacian spectra of digraph transformations
A generalization of Boesch's theorem
On the spectral characterization of some unicyclic graphs
On the spectral characterizations of graphs
Laplacian spectral characterization of (broken) dandelion graphs
On the Laplacian coefficients of unicyclic graphs with prescribed matching number
On family of graphs with minimum number of spanning trees
The number of spanning trees in a new lexicographic product of graphs
Volume bounds for the phase-locking region in the Kuramoto model
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
Graphs whose spectrum determined by non-constant coefficients
Spanning trees and even integer eigenvalues of graphs
Ordering of trees with fixed matching number by the Laplacian coefficients
Spectral characterizations of lollipop graphs
On the Laplacian coefficients of unicyclic graphs
Spanning trees of extended graphs
On the Laplacian coefficients of bicyclic graphs
Weighted complexities of graph products and bundles
Comparison of graphs by their number of spanning trees
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
Laplacian matrices of graphs: A survey
A survey of some network reliability analysis and synthesis results
One special double starlike graph is determined by its Laplacian spectrum
On the characterization of graphs with maximum number of spanning trees
Some graphs determined by their spectra
Число Деревьев Графа, Содержащих Заднный Лес
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
Spanning trees of descendants of a complete graph
Spanning tree formulas and Chebyshev polynomials
The number of spanning trees in the composition graphs
Laplacian spectral characterization of some graph products
Some results on signless Laplacian coefficients of graphs
The complexity of some classes of pyramid graphs created from a gear graph
Maximal determinant knots
Forest matrices around the Laplacian matrix
Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
Hearing shapes viap-adic Laplacians
The multi-fan graphs are determined by their Laplacian spectra
Connected graphs with a minimal number of spanning trees
Which wheel graphs are determined by their Laplacian spectra?
Number of spanning trees in the sequence of some graphs
Determination of double quasi-star tree from its Laplacian spectrum
Undirected simple connected graphs with minimum number of spanning trees
On the complexity of a class of pyramid graphs and Chebyshev polynomials
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
On generic forms of complementary graphs
Extremal graphs for the Tutte polynomial
On the spectra of nonsymmetric Laplacian matrices
D-optimal block designs with at most six varieties
Tree counting polynomials for labelled graphs. I: Properties
A special class of triple starlike trees characterized by Laplacian spectrum
The number of rooted forests in circulant graphs
The Laplacian permanental polynomial for trees
On the number of all substructures containing at most four edges
Asymptotic normality of Laplacian coefficients of graphs
A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
On the signless Laplacian coefficients of unicyclic graphs
Uniformly optimally reliable graphs: A survey
Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs
Counting rooted spanning forests for circulant foliation over a graph
Complexity of graphs generated by wheel graph and their asymptotic limits
A flow in the forest
On the Laplacian coefficients of tricyclic graphs
On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices
Laplacian spectra and spanning trees of threshold graphs
When (signless) Laplacian coefficients meet matchings of subdivision
On graphs with randomly deleted edges
Several improved asymptotic normality criteria and their applications to graph polynomials
Schur convex functions on the spectra of graphs
Laplacian spectral characterization of 3-rose graphs
Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
On the distribution of eigenvalues of graphs
On the Jacobian group of a cone over a circulant graph
Laplacian spectrum of weakly quasi-threshold graphs
Laplace spectra of orgraphs and their applications
On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels
On the structure of Laplacian characteristic polynomial of circulant graphs
Enumeration of spanning trees in prisms of some graphs
Ordering connected graphs by their Kirchhoff indices
On the Laplacian coefficients of graphs under some transformations
The number of spanning trees of the Cartesian product of regular graphs

This page was built for publication: A certain polynomial of a graph and graphs with an extremal number of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393403)