Distance spectral radius of trees with fixed maximum degree

DOI10.13001/1081-3810.1366zbMATH Open1189.05050arXiv1105.5838OpenAlexW2146626860MaRDI QIDQ3559098FDOQ3559098

Aleksandar Ilić, Dragan Stevanović

Publication date: 11 May 2010

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Abstract: Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $det(lambdaI-L(G))=su{m}_{k=0}^n(-1{)}^k{c}_{k}lambd{a}^{n-k}$. It is well known that for trees the Laplacian coefficient $c_{n-2}$ is equal to the Wiener index of $G$. Using a result of Zhou and Gutman on the relation between the Laplacian coefficients and the matching numbers in subdivided bipartite graphs, we characterize first the trees with given diameter and then the connected graphs with given radius which simultaneously minimize all Laplacian coefficients. This approach generalizes recent results of Liu and Pan [MATCH Commun. Math. Comput. Chem. 60 (2008), 85--94] and Wang and Guo [MATCH Commun. Math. Comput. Chem. 60 (2008), 609--622] who characterized $n$-vertex trees with fixed diameter $d$ which minimize the Wiener index. In conclusion, we illustrate on examples with Wiener and modified hyper-Wiener index that the opposite problem of simultaneously maximizing all Laplacian coefficients has no solution.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

distance matrixmaximum degreedistance spectral radiusBroom graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cited In (64)

• Minimizing the distance spectral radius of uniform hypertrees with given parameters
• Degree resistance distance of trees with some given parameters
• The first eigenvector of a distance matrix is nearly constant
• On distance spectral radius of graphs with given number of pendant paths of fixed length
• On the distance and distance signless Laplacian spectral radii of tricyclic graphs
• Ordering trees by their distance spectral radii
• Distance spectral radius of uniform hypergraphs
• Graph transformation and distance spectral radius
• Some graft transformations and its applications on the distance spectral radius of a graph
• On the distance spectral radius of cacti
• Extremal unicyclic graphs with minimal distance spectral radius
• ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS
• Distance spectral radius of trees with given matching number
• Distance spectral radius of graphs with \(r\) pendent vertices
• Some graft transformations and its application on a distance spectrum
• Distance spectra and distance energy of integral circulant graphs
• Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
• The effect of graft transformations on distance signless Laplacian spectral radius
• On the maximal distance spectral radius of graphs without a pendent vertex
• Distance spectral radius of digraphs with given connectivity
• Maximal distance spectral radius of trees
• On distance signless Laplacian spectrum and energy of graphs
• The distance spectral radius of trees
• The anti-adjacency matrix of a graph: eccentricity matrix
• On the distance spectral radius of bipartite graphs
• Distance spectral spread of a graph
• Maximal distance spectral radius of 4-chromatic planar graphs
• The distance spectral radius of digraphs
• On the D_α-spectra of graphs
• On distance spectral radius of graphs
• Distance spectra of graphs: a survey
• Distance spectral radius of unicyclic graphs with fixed maximum degree
• A proof of a conjecture on the distance spectral radius
• On the second largest distance eigenvalue of a block graph
• Extremal problems on distance spectra of graphs
• On the distance spectral radius of some graphs
• Title not available (Why is that?)
• On the least distance eigenvalues of the second power of a graph
• On the least distance eigenvalue of a graph
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• The effect of a graft transformation on distance spectral radius
• On the distance spectral radius of trees
• A note on distance spectral radius of trees
• The distance eigenvalues of the complements of unicyclic graphs
• On the distance Laplacian spectral radius of bipartite graphs
• Extremal cacti of given matching number with respect to the distance spectral radius
• The distance spectrum of a tree
• On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• On the distance \(\alpha \)-spectral radius of a connected graph
• On the extremal properties of the average eccentricity
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Distance spectral radius of trees with given number of segments
• On the distance spectral radius of trees with given degree sequence
• Unimodality of principal eigenvector and its applications
• On the second largest distance eigenvalue
• Convex and quasiconvex functions on trees and their applications
• Graph functions maximized on a path
• Distance spectral radius of trees with fixed number of pendent vertices
• Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
• Distance spectral radius of the complements of trees with fixed parameters
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• On the \(D_\alpha\)-spectral radius of cacti and bicyclic graphs
• Distance spectral radius of a tree with given diameter

Recommendations

• On the distance spectral radius of trees 👍 👎
• Distance spectral radius of trees with given matching number 👍 👎
• Laplacian spectral radius of trees with given maximum degree 👍 👎
• The distance spectral radius of trees 👍 👎
• Distance spectral radius of trees with given number of segments 👍 👎
• On the distance spectral radius of trees with given degree sequence 👍 👎
• Distance spectral radius of trees with fixed number of pendent vertices 👍 👎
• Maximal distance spectral radius of trees 👍 👎
• On distance spectral radius of trees with fixed maximum degree 👍 👎
• Trees with given maximum degree minimizing the spectral radius 👍 👎

This page was built for publication: Distance spectral radius of trees with fixed maximum degree

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