围长为6的图的平方根的唯一性
Uniqueness of graph square roots of girth six
摘要：
证明了如果两个围长至少为6的图有同构平方，则这两个图同构。这是Ross和Harary关于树的结果和Farzad等人关于围长至少为7的图的结果的最佳可能的推广。本文还对图的高次幂重构问题作了一点讨论。
英文摘要：
We prove that if two graphs of girth at least 6 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 7. We also make a remark on reconstruction of graphs from their higher powers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
