On spectral properties of digraphs about maximum distance
Spectral properties of graphs are studied extensively through various matrices associated with graphs as well as digraphs. The study of the spectral properties of digraphs is limited. The maximum distance matrix of a strongly connected digraph is a symmetric matrix whose rows and columns are indexed by the vertices, the entries of which correspond to the maximum directed distance between the vertices. In this paper, the authors determine the digraphs that uniquely minimize the largest eigenvalue of the maximum distance matrix in some classes of strongly connected digraphs, and the \(n\)-vertex strongly connected digraphs for which the maximum distance matrices have an eigenvalue with multiplicity \(n-1\).
- A new kind of Hermitian matrices for digraphs
- Digraphs
- Distance in digraphs
- Distance spectra of graphs: a survey
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 19216 (Why is no real title available?)
- scientific article; zbMATH DE number 95269 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- On extremal spectral results of digraphs based on sum distance
- The dichromatic number of a digraph
- The generalized distance matrix of digraphs
This page was built for publication: On spectral properties of digraphs about maximum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550905)