A note on non-R-cospectral graphs

MaRDI QIDQ521370zbMATH OpenFDO

Authors Fenjin Liu, Wei Wang

Publication date 10 April 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p48

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(\mathbb{R}\)-cospectral graphsirrational orthogonal matrixwalk generating function

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Summary: Two graphs \(G\) and \(H\) are called \(\mathbb{R}\)-cospectral if \(A(G)+yJ\) and \(A(H)+yJ\) (where \(A(G)\), \(A(H)\) are the adjacency matrices of \(G\) and \(H\), respectively, \(J\) is the all-one matrix) have the same spectrum for all \(y\in\mathbb{R}\). In this note, we give a necessary condition for having \(\mathbb{R}\)-cospectral graphs. Further, we provide a sufficient condition ensuring only irrational orthogonal similarity between certain cospectral graphs. Some concrete examples are also supplied to exemplify the main results.

Recommendations

• Cospectral graphs and the generalized adjacency matrix
• Spectra of graph operations based on R-graph
• Constructing cospectral graphs via regular rational orthogonal matrices with level two
• Finding singularly cospectral graphs
• Cospectral graphs and regular orthogonal matrices of level 2

Cites work

• A new method for constructing graphs determined by their generalized spectrum
• A note on cospectral graphs
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Constructing cospectral graphs
• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral graphs and the generalized adjacency matrix
• Developments on spectral characterizations of graphs
• Enumeration of cospectral graphs.
• Generalized spectral characterization of graphs revisited
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• On the spectral characterization of pineapple graphs
• Spectral characterizations of almost complete graphs
• Spectral determination of graphs whose components are paths and cycles
• Which graphs are determined by their spectrum?

Cited in

(6)

• Generalized spectral characterizations of almost controllable graphs
• The smallest pair of cospectral cubic graphs with different chromatic indexes
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs
• Generalized cospectral graphs with and without Hamiltonian cycles
• Non-isomorphic graphs with cospectral symmetric powers
• Cospectral graphs and the generalized adjacency matrix

This page was built for publication: A note on non-\(\mathbb{R}\)-cospectral graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521370)