Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
DOI10.1007/978-3-319-29221-2_3zbMath1444.05085OpenAlexW2398757620MaRDI QIDQ2795932
Pratima Panigrahi, Fouzul Atik
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_3
distance matrixgeneralized Petersen graphsdistance spectral radiusdistance eigenvalue\(k\)-partitioned transmission regular graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance spectral radius of trees with given matching number
- Distance spectral radius of graphs with \(r\) pendent vertices
- Spectra of graphs
- On the distance spectral radius of bipartite graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- On distance matrices and Laplacians
- Distance matrix and Laplacian of a tree with attached graphs
- On the distance spectral radius of trees
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Distance spectral radius of trees with fixed maximum degree
This page was built for publication: Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs