Tree counting polynomials for labelled graphs. I: Properties

DOI10.1016/0016-0032(81)90053-3MaRDI QIDQ1160141zbMATHOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3672238 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3307340 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3107543 (Why is no real title available?)
• A certain polynomial of a graph and graphs with an extremal number of trees
• An Analysis of the Wang Algebra of Networks
• Coefficient relationship between rook and chromatic polynomials
• Comparison of graphs by their number of spanning trees
• Generating formulas for the number of trees in a graph
• Nonisomorphic trees with the same T-polynomial
• On a general class of graph polynomials
• Parallel concepts in graph theory
• Stirling number identities from chromatic polynomials
• The Determinant of the Adjacency Matrix of a Graph
• The characteristic polynomial of a graph
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• \(\sigma\)-polynomials and graph coloring

Cited in

(6)

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

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

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