Nonisomorphic graphs with the same t-polynomial (Q1089010): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90057-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988032956 / rank | |||
Normal rank | |||
Revision as of 22:41, 19 March 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
