The construction of cospectral graphs with respect to the generalized adjacency matrix
From MaRDI portal
Publication:6568569
DOI10.18523/2617-7080I2018P11-14MaRDI QIDQ6568569FDOQ6568569
Authors: D. S. Grushka, V. O. Lebid'
Publication date: 8 July 2024
Published in: Mogylyans'kyĭ Matematychnyĭ Zhurnal (Search for Journal in Brave)
Recommendations
- Enumeration of cospectral graphs.
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- Graphs with at most one generalized cospectral mate
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)
Cited In (1)
This page was built for publication: The construction of cospectral graphs with respect to the generalized adjacency matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568569)