Tree counting polynomials for labelled graphs. I: Properties

DOI10.1016/0016-0032(81)90053-3zbMath0477.05046OpenAlexW1987546852MaRDI QIDQ1160141

Samuel D. Bedrosian

Publication date: 1981

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(81)90053-3

zbMATH Keywords

characteristic polynomialslabelled graphspolynomial representations for connected graphs

Mathematics Subject Classification ID

Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Nonisomorphic graphs with the same t-polynomial ⋮ The asymptotic number of spanning trees in circulant graphs ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Counting trees in directed regular multigraphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ On generic forms of complementary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a general class of graph polynomials
• Comparison of graphs by their number of spanning trees
• Coefficient relationship between rook and chromatic polynomials
• Nonisomorphic trees with the same T-polynomial
• Stirling number identities from chromatic polynomials
• Parallel concepts in graph theory
• A certain polynomial of a graph and graphs with an extremal number of trees
• \(\sigma\)-polynomials and graph coloring
• Generating formulas for the number of trees in a graph
• The characteristic polynomial of a graph
• The Determinant of the Adjacency Matrix of a Graph
• An Analysis of the Wang Algebra of Networks
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

This page was built for publication: Tree counting polynomials for labelled graphs. I: Properties