On extremal spectral results of digraphs based on sum distance

DOI10.1016/J.DAM.2022.05.011zbMath1501.05008OpenAlexW4282018571MaRDI QIDQ2166213

Yanyan Li

Publication date: 24 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.05.011

zbMATH Keywords

sum distancesum distance eigenvaluessum distance Laplacian eigenvaluessum distance signless Laplacian eigenvalues

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Two Laplacians for the distance matrix of a graph
• A shorter proof of the distance energy of complete multipartite graphs
• Spectra of graphs
• Distance in digraphs
• The generalized distance matrix
• Interlacing families and the Hermitian spectral norm of digraphs
• The dichromatic number of a digraph
• The generalized distance matrix of digraphs
• On the distance \(\alpha \)-spectral radius of a connected graph
• Distance spectra of graphs: a survey
• A new kind of Hermitian matrices for digraphs
• The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• Large regular bipartite graphs with median eigenvalue 1
• On the distance signless Laplacian of a graph
• Merging the A-and Q-spectral theories
• Some properties of the distance Laplacian eigenvalues of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On extremal spectral results of digraphs based on sum distance