Indexed metadata
Uniqueness of Graph Square Roots of Girth Six
Anna Adamaszek, Michał Adamaszek
Source abstract
We prove that if two graphs of girth at least have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least . We also make a remark on reconstruction of graphs from their higher powers.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.