Abstract
The Seidel spectrum of a graph is defined as the multiset of all eigenvalues of its Seidel matrix. For two simple connected graphs [Formula: see text] and [Formula: see text], let us denote the subdivision-vertex join and subdivision-edge join by [Formula: see text] and [Formula: see text], respectively. In this paper, we completely determine the Seidel spectrum and corresponding Seidel eigenvectors of [Formula: see text] and [Formula: see text]. As an application, we give a sufficient and necessary condition for [Formula: see text] and [Formula: see text] to be Seidel integral.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
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.
