Abstract
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and θ such that | S i ∩ S j | = τ for any two adjacent vertices i and j , and | S i ∩ S j | = θ for any two distinct non-adjacent vertices i and j , where S k denotes the neighborhood of the vertex k . We say that a graph G of order n is walk regular if and only if its vertex deleted subgraphs G i = G ∖︀ i are cospectral for i = 1 , 2 , … , n . Let G be a walk regular graph of order 4 k + 1 and degree 2 k which is cospectral to its complement G ¯ . Let H i be switching equivalent to G i with respect to S i ⊆ V ( G i ) . We here prove that G is strongly regular if and only if Δ ( G i ) = Δ ( H i ) for i = 1 , 2 , … , 4 k + 1 , where Δ ( G ) is the number of triangles of a graph G .
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.