Distance spectral radius of trees with given matching number
From MaRDI portal
Publication:602758
DOI10.1016/J.DAM.2010.06.018zbMATH Open1208.05018OpenAlexW2094856097MaRDI QIDQ602758FDOQ602758
Publication date: 5 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.018
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to algorithms
- The distance spectrum of a tree
- Distance spectral radius of trees with fixed maximum degree
- Wiener index of trees: Theory and applications
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- On acyclic conjugated molecules with minimal energies
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- The distance spectrum and energy of the compositions of regular graphs
- Average distance and independence number
- Bounds on the largest eigenvalues of trees with a given size of matching
- On distance matrices and Laplacians
- On the minimal energy ordering of trees with perfect matchings
- On acyclic systems with minimal Hosoya index
- On extremal unicyclic molecular graphs with maximal Hosoya index
- Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
Cited In (51)
- The inertia and energy of the distance matrix of a connected graph
- Ordering trees by their distance spectral radii
- Graph transformation and distance spectral radius
- Some graft transformations and its applications on the distance spectral radius of a graph
- Extremal unicyclic graphs with minimal distance spectral radius
- Distance spectral radius of graphs with \(r\) pendent vertices
- Some graft transformations and its application on a distance spectrum
- Distance spectral radii of k-uniform hypertrees with given parameters
- Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
- Distance spectral radius of digraphs with given connectivity
- Maximal distance spectral radius of trees
- On the distance spectral radius of bipartite graphs
- Distance spectral spread of a graph
- The distance spectral radius of digraphs
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- On distance spectral radius of graphs
- Sharp bounds on distance spectral radius of graphs
- Distance spectra of graphs: a survey
- On the distance spectral radius of some graphs
- On the least distance eigenvalues of the second power of a graph
- The distance energy of clique trees
- On the least distance eigenvalue of a graph
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- Further results on the distance spectral radius of graphs
- 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
- On the distance signless Laplacian spectral radius of graphs
- Bounds on the distance signless Laplacian spectral radius in terms of clique number
- Connectivity, diameter, independence number and the distance spectral radius of graphs
- Distance spectral radius of trees with fixed maximum degree
- On the distance spectral radius of trees with given degree sequence
- A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
- On the distance spectrum of graphs
- Convex and quasiconvex functions on trees and their applications
- Distance spectral radius of trees with fixed number of pendent vertices
- On graphs with at least three distance eigenvalues less than \(-1\)
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
- Distance spectral radius of the complements of trees with fixed parameters
- Inertia and distance energy of line graphs of unicyclic graphs
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Distance spectral radius of a tree with given diameter
- The distance spectrum of the complements of graphs of diameter greater than three
- The distance spectrum of the complements of graphs with two pendent vertices
- Invariants for incidence matrix of a tree
- Distance spectral radius and fractional matching in t -connected graphs
Uses Software
Recommendations
- On the distance spectral radius of trees π π
- Distance spectral radius of trees with fixed maximum degree π π
- The distance spectral radius of trees π π
- A note on 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 π π
- Distance spectral radius of the complements of trees with fixed parameters π π
- Maximal distance spectral radius of trees π π
- On distance spectral radius of trees with fixed maximum degree π π
This page was built for publication: Distance spectral radius of trees with given matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q602758)
