Spectral determination of graphs with one positive anti-adjacency eigenvalue

DOI10.1016/J.AMC.2022.126995OpenAlexW4211174568MaRDI QIDQ2113707FDOQ2113707

Authors: Xingyu Lei, Jianfeng Wang 

Publication date: 14 March 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.126995

Recommendations

• The graphs with all but two eigenvalues equal to \(\pm 1\)
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• The spectral characterization of wind-wheel graphs
• On two problems related to anti-adjacency (eccentricity) matrix
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)

Mathematics Subject Classification ID

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

Cites Work

• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• On the two largest \(Q\)-eigenvalues of graphs
• New families of graphs determined by their generalized spectrum
• Title not available (Why is that?)
• Oriented graphs determined by their generalized skew spectrum
• Enumeration of cospectral and coinvariant graphs
• The anti-adjacency matrix of a graph: eccentricity matrix
• \(D_{\max}\) -- matrix of dominant distances in a graph
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• The kite graph is determined by its adjacency spectrum
• Kite graphs determined by their spectra
• Spectral properties of the eccentricity matrix of graphs
• Eccentricity energy change of complete multipartite graphs due to edge deletion
• Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
• Spectra of eccentricity matrices of graphs
• On the largest and least eigenvalues of eccentricity matrix of trees
• On the eigenvalues of eccentricity matrix of graphs
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• Energy and inertia of the eccentricity matrix of coalescence of graphs
• Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
• On the spectral characterization of mixed extensions of \(P_3\)
• Spectral characterization of mixed extensions of small graphs
• The graphs cospectral with the pineapple graph

Cited In (11)

• The eccentricity matrix of a digraph
• On the least eccentricity eigenvalue of graphs
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter
• The eccentricity spread of weak-friendship graphs
• On the eccentricity matrices of trees: inertia and spectral symmetry
• Extremal problems for the eccentricity matrices of complements of trees
• Minimizers for the energy of eccentricity matrices of trees
• The diameter and eccentricity eigenvalues of graphs
• On two problems related to anti-adjacency (eccentricity) matrix
• The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1

This page was built for publication: Spectral determination of graphs with one positive anti-adjacency eigenvalue

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