Name
Abstract | ||
|---|---|---|
Suppose that the vertex set of a graph G is V ( G ) = { v 1 , , v n } . Then we denote by T r G ( v i ) the sum of distances between v i and other vertices of G . Let T r ( G ) be the n í n diagonal matrix with its ( i , i ) -entry equal to T r G ( v i ) and D ( G ) be the distance matrix of G . Then L D ( G ) = T r ( G ) - D ( G ) is the distance Laplacian matrix of G . The distance Laplacian spectral radius of G is the spectral radius of L D ( G ) . In this paper we describe the unique graph with minimum distance Laplacian spectral radius among all connected bipartite graphs of order n with a given matching number and a given vertex connectivity, respectively. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2015.01.023 | Discrete Applied Mathematics |
Keywords | Field | DocType |
distance laplacian spectral radius,matching number,vertex connectivity | Discrete mathematics,Laplacian matrix,Combinatorics,Spectral radius,Vertex (geometry),Bipartite graph,Vertex connectivity,Distance matrix,Diagonal matrix,Mathematics,Laplace operator | Journal |
Volume | Issue | ISSN |
186 | C | 0166-218X |
Citations | PageRank | References |
2 | 0.91 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aihong Niu | 1 | 2 | 1.93 |
| Dandan Fan | 2 | 2 | 2.60 |
| Guoping Wang | 3 | 488 | 63.02 |