Spectral characterizations of two families of nearly complete bipartite graphs

DOI10.4310/AMSA.2017.V2.N2.A2zbMATH Open1378.05120arXiv1601.07012OpenAlexW2963792805MaRDI QIDQ679638FDOQ679638

Authors: Chia-An Liu, Chih-Wen Weng 

Publication date: 19 January 2018

Published in: Annals of Mathematical Sciences and Applications (Search for Journal in Brave)

Abstract: It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each of which is obtained from a complete bipartite graph by adding a vertex and an edge incident on the new vertex and an original vertex, which are not determined by their spectra.

Full work available at URL: https://arxiv.org/abs/1601.07012

Recommendations

• Spectral characterizations of almost complete graphs
• Per-spectral characterizations of some bipartite graphs
• Adjacent spectral characterization of complete bipartite graphs
• Two families of spanning subgraphs of a complete graph determined by their spectra
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices

zbMATH Keywords

adjacency matrixbipartite graphdetermined by the spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cited In (13)

• Adjacent spectral characterization of complete bipartite graphs
• An extending result on spectral radius of bipartite graphs
• Spectral characterizations of almost complete graphs
• Counterexamples of the Bhattacharya-Friedland-Peled conjecture
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices
• A note on a theorem of Horst Sachs
• Per-spectral characterizations of some bipartite graphs
• On the spectrum of some signed complete and complete bipartite graphs
• Spectra of some special bipartite graphs
• Complete (2,2) Bipartite Graphs
• Spectral characterization of families of split graphs
• When can the components of NEPS of connected bipartite graphs be almost cospectral?
• Geometry of error amplification in solving the Prony system with near-colliding nodes

This page was built for publication: Spectral characterizations of two families of nearly complete bipartite graphs

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