Back to Search
Start Over
The Seidel spectrum of two variants of join operations.
- Source :
-
Discrete Mathematics, Algorithms & Applications . May2023, Vol. 15 Issue 4, p1-10. 10p. - Publication Year :
- 2023
-
Abstract
- The Seidel spectrum of a graph is defined as the multiset of all eigenvalues of its Seidel matrix. For two simple connected graphs G 1 and G 2 , let us denote the subdivision-vertex join and subdivision-edge join by G 1 ∨ ̇ G 2 and G 1 ⊻ G 2 , respectively. In this paper, we completely determine the Seidel spectrum and corresponding Seidel eigenvectors of G 1 ∨ ̇ G 2 and G 1 ⊻ G 2 . As an application, we give a sufficient and necessary condition for G 1 ∨ ̇ G 2 and G 1 ⊻ G 2 to be Seidel integral. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH connectivity
*EIGENVECTORS
*EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 15
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 163408772
- Full Text :
- https://doi.org/10.1142/S1793830922501063