Nonisomorphic trees with the same T-polynomial

DOI10.1016/0020-0190(77)90029-1zbMath0369.05023OpenAlexW2080345787MaRDI QIDQ1243732

M. A. Zaĭtsev, E. A. Dinits, Alexander K. Kelmans

Publication date: 1977

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(77)90029-1

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Algorithms in computer science (68W99)

Related Items

Nonisomorphic graphs with the same t-polynomial ⋮ Laplacian spectra and spanning trees of threshold graphs ⋮ Tree counting polynomials for labelled graphs. I: Properties ⋮ Ordering trees by algebraic connectivity ⋮ Laplacian matrices of graphs: A survey

Cites Work

• 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
• The characteristic polynomial of a graph
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees