Comparison of graphs by their number of spanning trees
From MaRDI portal
Publication:1233439
DOI10.1016/0012-365X(76)90102-3zbMath0346.05101OpenAlexW1970826561MaRDI QIDQ1233439
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90102-3
Related Items
Some extremal properties of the multiplicatively weighted Harary index of a graph, Walks and paths in trees, On graphs with randomly deleted edges, Tracking network dynamics: a survey using graph distances, Nonisomorphic graphs with the same t-polynomial, 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, Complete signed graphs with largest maximum or smallest minimum eigenvalue, Finding the graph with the maximum number of spanning trees, Edge-grafting transformations on the average eccentricity of graphs and their applications, Tree counting polynomials for labelled graphs. I: Properties, On the (reverse) cover cost of trees with some given parameters, On the complexity group of stable curves, On the extremal total reciprocal edge-eccentricity of trees, Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications, Spanning trees of extended graphs, Graphs with the maximum or minimum number of 1-factors, Comparison of graphs by their number of spanning trees, Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications, Nonisomorphic trees with the same T-polynomial, On the distribution of eigenvalues of graphs, On generic forms of complementary graphs, On the reformulated reciprocal sum-degree distance of graph transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Comparison of graphs by their number of spanning trees
- Parallel concepts in graph theory
- A certain polynomial of a graph and graphs with an extremal number of trees
- On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
- Число Деревьев Графа, Содержащих Заднный Лес
- Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
