Distance spectral radius of trees with fixed maximum degree

DOI10.13001/1081-3810.1366MaRDI QIDQ3559098zbMATH OpenOpenAlexFDO

Authors Dragan Stevanović, Aleksandar Ilić

Publication date 11 May 2010

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

Full work available at URL https://arxiv.org/abs/1105.5838, https://eudml.org/doc/228893, http://www.emis.de/journals/ELA/ela-articles/abstracts/abs_vol20_pp168-179.pdf

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

zbMATH Keywords

Broom graphdistance matrixdistance spectral radiusmaximum degree

Mathematics Subject Classification ID

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

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.

Recommendations

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

Cited in

(70)

• The anti-adjacency matrix of a graph: eccentricity matrix
• A note on distance spectral radius of trees
• Extremal cacti of given matching number with respect to the distance spectral radius
• On the least distance eigenvalues of the second power of a graph
• On distance spectral radius of graphs
• On the distance and distance signless Laplacian spectral radii of tricyclic graphs
• Maximal distance spectral radius of 4-chromatic planar graphs
• On the distance -spectral radius of a connected graph
• On the D_-spectral radius of cacti and bicyclic graphs
• The distance eigenvalues of the complements of unicyclic graphs
• On the second largest distance eigenvalue of a block graph
• Distance spectral radius of trees with given number of segments
• Unimodality of principal eigenvector and its applications
• Extremal problems on distance spectra of graphs
• The effect of a graft transformation on distance spectral radius
• Distance spectra of graphs: a survey
• Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
• On the distance spectral radius of trees with given degree sequence
• On the distance Laplacian spectral radius of bipartite graphs
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Convex and quasiconvex functions on trees and their applications
• Distance spectral radius of trees with fixed number of pendent vertices
• On the least distance eigenvalue of a graph
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
• The distance spectral radius of digraphs
• Ordering trees by their distance spectral radii
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• 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
• Distance spectral radius of the complements of trees with fixed parameters
• Distance spectral radius of some k-partitioned transmission regular graphs
• On the distance spectral radius of trees
• Further results on the distance spectral radius of graphs
• The effect of graft transformations on distance signless Laplacian spectral radius
• Graph transformation and distance spectral radius
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• Distance spectral radius of a tree with given diameter
• The distance spectrum of a tree
• On the extremal properties of the average eccentricity
• On the maximal distance spectral radius of graphs without a pendent vertex
• Some graft transformations and its applications on the distance spectral radius of a graph
• Distance spectral radius of digraphs with given connectivity
• On the distance spectral radius of some graphs
• On the distance spectral radius of cacti
• Maximal distance spectral radius of trees
• The distance spectral radius of trees
• Extremal unicyclic graphs with minimal distance spectral radius
• On the maximal distance spectral radius in a class of bicyclic graphs
• Distance spectral radius of series-reduced trees with parameters
• On distance signless Laplacian spectrum and energy of graphs
• Distance spectral radius of unicyclic graphs with fixed maximum degree
• The multiplicity of \(A_{\alpha}\)-eigenvalues of graphs
• Degree resistance distance of trees with some given parameters
• On distance spectral radius of trees with fixed maximum degree
• On the second largest distance eigenvalue
• On the \(D_\alpha\)-spectra of graphs
• Distance spectral radius of trees with given matching number
• Minimizing the distance spectral radius of uniform hypertrees with given parameters
• A proof of a conjecture on the distance spectral radius
• Distance spectral radius of graphs with \(r\) pendent vertices
• Some graft transformations and its application on a distance spectrum
• On the distance spectral radius of bipartite graphs
• Local vertex energy of brooms and double-star trees
• On distance spectral radius of books
• Extremal distance spectral radius of graphs with fixed size
• Distance spectral spread of a graph
• Bounds for the distance spectral radius of split graphs
• Graph functions maximized on a path
• Distance spectra and distance energy of integral circulant graphs

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)