Nonisomorphic trees with the same T-polynomial

DOI10.1016/0020-0190(77)90029-1MaRDI QIDQ1243732zbMATH OpenOpenAlexFDO

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

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)

Cites work

• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• A certain polynomial of a graph and graphs with an extremal number of trees
• Comparison of graphs by their number of spanning trees
• Parallel concepts in graph theory
• The characteristic polynomial of a graph
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

Cited in

(5)

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

This page was built for publication: Nonisomorphic trees with the same T-polynomial

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