Nonisomorphic trees with the same T-polynomial

DOI10.1016/0020-0190(77)90029-1zbMATH Open0369.05023OpenAlexW2080345787MaRDI QIDQ1243732FDOQ1243732

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

• 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
• Title not available (Why is that?)
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• The characteristic polynomial of a graph

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)