On graphs with exactly one anti-adjacency eigenvalue and beyond

DOI10.1016/j.disc.2023.113373OpenAlexW4321381909MaRDI QIDQ2699939

Hakan Küçük, Sezer Sorgun, Mei Lu, Xingyu Lei, Jianfeng Wang

Publication date: 20 April 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluesmixed extensioneccentricity matrixanti-adjacency matrixHL-index

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

The eccentricity spread of weak-friendship graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• Spectra of graphs
• The anti-adjacency matrix of a graph: eccentricity matrix
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Spectral properties of the eccentricity matrix of graphs
• 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
• Graph energy based on the eccentricity matrix
• 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
• Median eigenvalues and the HOMO-LUMO index of graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Median eigenvalues of bipartite graphs
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Spectral determinations and eccentricity matrix of graphs
• Median Eigenvalues of Bipartite Subcubic Graphs

This page was built for publication: On graphs with exactly one anti-adjacency eigenvalue and beyond