Finding singularly cospectral graphs
نویسندگان
چکیده
Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral is formed by two such that absolute values their nonzero eigenvalues coincide. Clearly, a also but converse may not true. almost if and multiplicities In this paper, we present necessary sufficient conditions for cospectral, giving an answer problem posted Nikiforov. addition, construct infinite family pairs noncospectral with unbounded number vertices. It clear necessarily true, families where both concepts: cospectrality agree.
منابع مشابه
Enumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملCospectral Graphs on 12 Vertices
We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related to the number of cospectral graphs.
متن کاملGraphs cospectral with starlike trees
A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called m-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral ma...
متن کاملA construction of distance cospectral graphs
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edge counts yet are cospectral with respect to the distance matrix. Further, we identify a subgraph switching behavior which constructs additional dis...
متن کاملNon-Isomorphic Graphs with Cospectral Symmetric Powers
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2022
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2022.2035306