Nonisomorphic graphs with the same t-polynomial (Q1089010)

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.