New constructions of nonregular cospectral graphs
We consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute the adjacency characteristic polynomial, the...
Main Authors: | Hamud Suleiman, Berman Abraham |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2024-02-01
|
Series: | Special Matrices |
Subjects: | |
Online Access: | https://doi.org/10.1515/spma-2023-0109 |
Similar Items
-
Construction of Cospectral Integral Regular Graphs
by: Bapat Ravindra B., et al.
Published: (2017-08-01) -
On Spectral Graph Determination
by: Igal Sason, et al.
Published: (2025-02-01) -
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
by: Das Arpita, et al.
Published: (2018-06-01) -
How to Distinguish Cospectral Graphs
by: Saeree Wananiyakul, et al.
Published: (2022-12-01) -
Connected graphs cospectral with a Friendship graph
by: Alireza Abdollahi, et al.
Published: (2014-06-01)