Remoteness and distance eigenvalues of a graph

DOI10.1016/J.DAM.2016.07.018zbMATH Open1346.05170arXiv1507.07083OpenAlexW2963282748MaRDI QIDQ323085FDOQ323085

Authors: Huiqiu Lin, Baoyindureng Wu, Kinkar Ch. Das 

Publication date: 7 October 2016

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

Abstract: Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $ho$ of $G$ is the maximum average distance from a vertex to all others and $partia{l}_{1}geqcdotsgeqpartia{l}_n$ are the distance eigenvalues of $G$. In cite{AH}, Aouchiche and Hansen conjectured that $ho+partia{l}_3>0$ when $dgeq3$ and $ho+partia{l}_{lfloorfrac7d8floor}>0.$ In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on $partia{l}_n+ho$ and $partia{l}_1-ho$ when $Gcong{K}_n$ and the extremal graphs are characterized.

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

Recommendations

• Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
• The difference between remoteness and radius of a graph
• A relation between proximity and the third largest distance eigenvalue of a graph
• Proximity, remoteness and distance eigenvalues of a graph
• Proximity and remoteness in graphs: results and conjectures

zbMATH Keywords

distance matrixremotenessdistance eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Distance spectra of graphs: a survey
• The distance spectrum of a tree
• On distance spectral radius of graphs
• On the least distance eigenvalue and its applications on the distance spread
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• Proof of conjectures on remoteness and proximity in graphs
• Proximity, remoteness and distance eigenvalues of a graph
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• The difference between remoteness and radius of a graph
• On the distance spectral radius of some graphs

Cited In (18)

• Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
• Comparing Wiener complexity with eccentric complexity
• On the sum of \(k\) largest distance eigenvalues of graphs
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Constructing new families of transmission irregular graphs
• On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
• A conjecture on average distance and diameter of a graph
• Remoteness, proximity and few other distance invariants in graphs
• Effects on distance energy of complete bipartite graphs by embedding edges
• A relation between proximity and the third largest distance eigenvalue of a graph
• Extremal problems on distance spectra of graphs
• On the \(D_\alpha\)-spectra of graphs
• On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
• The distance eigenvalues of the complements of unicyclic graphs
• On the largest distance (signless Laplacian) eigenvalue of non-transmission-regular graphs
• Distance Laplacian spectra of graphs: a survey
• Proximity and remoteness in graphs: a survey
• The difference between remoteness and radius of a graph

This page was built for publication: Remoteness and distance eigenvalues of a graph

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