On the distance Laplacian spectral radius of bipartite graphs
DOI10.1016/J.DAM.2015.01.023zbMATH Open1311.05055OpenAlexW2066555486MaRDI QIDQ2345612FDOQ2345612
Dandan Fan, Guoping Wang, Aihong Niu
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.023
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Distance spectral radius of trees with fixed maximum degree
- Two Laplacians for the distance matrix of a graph
- Some graft transformations and its applications on the distance spectral radius of a graph
- Distance spectral radius of trees with given matching number
- Some graft transformations and its application on a distance spectrum
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- On the maximal distance spectral radius of graphs without a pendent vertex
- On the distance spectral radius of bipartite graphs
Cited In (22)
- On the Sum of Distance Laplacian Eigenvalues of Graphs
- Matching number, connectivity and eigenvalues of distance signless Laplacians
- Title not available (Why is that?)
- On the distance Laplacian spectral radius of bicyclic graphs
- Correction to ``On the distance Laplacian spectral radius of bipartite graphs
- On the first two largest distance Laplacian eigenvalues of unicyclic graphs
- On distance Laplacian spectral radius and chromatic number of graphs
- The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
- The Laplacian spectral radius of a class of bipartite graphs
- The generalized path matrix and energy
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number
- Extremal results on distance Laplacian spectral radius of graphs
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
- On maximum Zagreb indices of bipartite graphs with a given connectivity
- The distance Laplacian spectral radius of clique trees
- On extremal bipartite graphs with a given connectivity
- Distance Laplacian spectra of graphs: a survey
- Distance Laplacian eigenvalues and chromatic number in graphs
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number
- The generalized distance matrix
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On the distance spectral radius of bipartite graphs π π
- On the Laplacian spectral radii of bipartite graphs π π
- On the distance Laplacian spectral radius of graphs π π
- The Laplacian spectral radius of some bipartite graphs π π
- On the distance Laplacian spectral radius of bicyclic graphs π π
- The Laplacian spectral radius of a class of bipartite graphs π π
This page was built for publication: On the distance Laplacian spectral radius of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345612)