Extremal cacti of given matching number with respect to the distance spectral radius
From MaRDI portal
Publication:1733732
DOI10.1016/j.amc.2016.06.031zbMath1410.05146OpenAlexW2472610420MaRDI QIDQ1733732
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.06.031
Related Items (10)
On the sizes of generalized cactus graphs ⋮ Perfect matching and distance spectral radius in graphs and bipartite graphs ⋮ Integral Cayley graphs over dicyclic group ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ On the largest and least eigenvalues of eccentricity matrix of trees ⋮ Extremal results for cacti ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ Maximum Balaban index and sum-Balaban index of cacti ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the signless Laplacian index of cacti with a given number of pendant vertices
- 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 least eigenvalue of cacti
- 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
- On the sum-connectivity index of cacti
- On the distance spectral radius of bipartite graphs
- The spectral radius of graphs on surfaces
- On distance matrices and Laplacians
- On distance spectral radius of graphs
- Distance spectra of graphs: a survey
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- Distance matrix and Laplacian of a tree with attached graphs
- Orderingn-vertex cacti with matching numberqby their spectral radii
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- Distance spectral radius of trees with fixed maximum degree
- On Distance Spectral Radius and Distance Energy of Graphs
- On spectral radius of the distance matrix
- On the index of cactuses with n vertices
- Reconstruction of Cacti
- Sharp bounds on Zagreb indices of cacti with k pendant vertices
- On the distance and distance Laplacian eigenvalues of graphs
This page was built for publication: Extremal cacti of given matching number with respect to the distance spectral radius
