On the sum of k largest distance eigenvalues of graphs

DOI10.1016/J.DAM.2018.12.031zbMATH Open1407.05151arXiv1805.09661OpenAlexW2963340133MaRDI QIDQ1735686FDOQ1735686

Authors: Huiqiu Lin 

Publication date: 28 March 2019

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

Abstract: For a connected graph $G$ with order $n$ and an integer $kgeq1$, we denote by ${\displaystyle }$S_k(D(G))=lambda_1(D(G))+cdots+lambda_k(D(G))${\displaystyle }$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and lower bound of $S_k(D(G))$. We determine the sharp lower bounds of $S_k(D(G))$ when $G$ is connected graph and is a tree, respectively, and characterize both the extremal graphs. Moreover, we conjecture that the upper bound is attained when $G$ is a path of order $n$ and prove some partial result supporting the conjecture. To prove our result, we obtain a sharp upper bound of $lambd{a}_2(D(G))$ in terms of the order and the diameter of $G$, where $lambd{a}_2(D(G))$ is the second largest distance eigenvalue of $G$. As applications, we prove a general inequality involving $lambd{a}_2(D(G))$, the independence number of $G$, and the number of triangles in $G$. An immediate corollary is a conjecture of Fajtlowicz, which was confirmed in cite{L15-L} by a different argument. We conclude this paper with some open problems for further study.

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

Recommendations

• A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs
• On the two largest distance eigenvalues of graph powers
• On the sum of the generalized distance eigenvalues of graphs
• Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
• On the distance and distance Laplacian eigenvalues of graphs

zbMATH Keywords

distance matrixdistance eigenvalueeigenvalue sumthe second largest distance eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• The Laplacian Spectrum of a Graph II
• Spectra of graphs
• Distance spectra of graphs: a survey
• The distance spectrum of a tree
• On the least distance eigenvalue and its applications on the distance spread
• The probabilistic method
• The Grone-Merris conjecture
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Proximity, remoteness and distance eigenvalues of a graph
• Remoteness and distance eigenvalues of a graph
• On the sum of \(k\) largest eigenvalues of graphs and symmetric matrices
• Ramsey numbers, graph eigenvalues, and a conjecture of Cao and Yuan
• On distance spectral radius and distance energy of graphs
• Coalescence, majorization, edge valuations and the laplacian spectra of graphs
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• On distance integral graphs
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles

Cited In (9)

• Some properties of generalized distance eigenvalues of graphs.
• A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs
• On Schatten \(p\)-norm of the distance matrices of graphs
• On the second largest distance eigenvalue of a block graph
• Extremal problems on distance spectra of graphs
• The sum of the \(k\) largest distance eigenvalues of graphs
• On the second largest eigenvalue of the generalized distance matrix of graphs
• Distance spectral radius and fractional matching in t -connected graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs

Uses Software

• GRAFFITI

This page was built for publication: On the sum of \(k\) largest distance eigenvalues of graphs

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