Nonisomorphic graphs with the same t-polynomial (Q1089010): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Nonisomorphic trees with the same T-polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comparison of graphs by their number of spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree counting polynomials for labelled graphs. I: Properties / rank | |||
Normal rank | |||
Latest revision as of 18:44, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonisomorphic graphs with the same t-polynomial |
scientific article |
Statements
Nonisomorphic graphs with the same t-polynomial (English)
0 references
1986
0 references
It is known that the smallest positive integer ''n'' for which there exist nonisomorphic trees (with n vertices) which have the same T-polynomial is ''11''. In this note, it is shown that if the trees in the above are replaced by simple graphs then ''6'' is the smallest positive integer. Further, it is shown that there exist two such (non-isomorphic) pairs (for \(n=6)\). It is observed that one pair is the complement of the other.
0 references
Laplace matrix
0 references
characteristic polynomial
0 references
HT-polynomial
0 references
