Tree counting polynomials for labelled graphs. I: Properties

DOI10.1016/0016-0032(81)90053-3zbMATH Open0477.05046OpenAlexW1987546852MaRDI QIDQ1160141FDOQ1160141

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

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

Cited In (6)

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

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)