Abstract
Let a connected graph Γ be locally disjoint union of at most three complete graphs and let Γ be cospectral with the Hamming graph H(3, q) (q ≥ 2). In this paper, we show that Γ is either the Hamming graph H(3, q) or the dual graph of H(3, 3) (i.e., the graph whose vertices are the triangles of H(3, 3) and two triangles are adjacent if they intersect).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.