Nonisomorphic graphs with the same t-polynomial

DOI10.1016/0020-0190(86)90057-8zbMath0618.05042OpenAlexW1988032956MaRDI QIDQ1089010

Yoshio Hattori

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90057-8

zbMATH Keywords

characteristic polynomialLaplace matrixHT-polynomial

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (2)

Ordering trees by algebraic connectivity ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Tree counting polynomials for labelled graphs. I: Properties
• Comparison of graphs by their number of spanning trees
• Nonisomorphic trees with the same T-polynomial
• A certain polynomial of a graph and graphs with an extremal number of trees

This page was built for publication: Nonisomorphic graphs with the same t-polynomial