The distance spectral radius of digraphs
From MaRDI portal
Publication:2444546
DOI10.1016/j.dam.2013.04.011zbMath1285.05080MaRDI QIDQ2444546
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.011
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
On the distance spectral radius of digraphs with given diameter, Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs, The generalized distance matrix of digraphs, The eccentricity matrix of a digraph, Effects on distance energy of complete bipartite graphs by embedding edges, Spectral radius and signless Laplacian spectral radius of strongly connected digraphs, The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity, Corrigendum to: ``The distance spectral radius of digraphs, The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters, Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
Cites Work
- Distance spectral radius of digraphs with given connectivity
- Distance spectral radius of trees with given matching number
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Eigenvalues and colorings of digraphs
- The dichromatic number of a digraph
- Spectral radius of digraphs with given dichromatic number
- 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
- Matrix Analysis
- Circular colorings of edge-weighted graphs
- The circular chromatic number of a digraph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
