Sharp bounds on the generalized distance spectral radius and generalized distance energy of strongly connected digraphs

DOI10.1051/ro/2024181MaRDI QIDQ6658907

Zengzhao Xu, Weige Xi

Publication date: 8 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

boundsstrongly connected digraphsgeneralized distance energygeneralized distance spectral radius

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) Connectivity (05C40)

Cites Work

• Bicyclic digraphs with maximal energy
• Bounds for the signless Laplacian energy of digraphs
• The generalized distance matrix
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs
• The generalized distance matrix of digraphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Distance spectra of graphs: a survey
• The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
• Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs
• On the minimal \(\mathcal{D}_\alpha -\) spectral radius of graphs subject to fixed connectivity
• Sharp upper bounds on the distance spectral radius of a graph
• The distance spectral radius of digraphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm
• Energy of digraphs
• Matrix Analysis
• On the distance signless Laplacian spectral radius of graphs and digraphs
• On the distance spectral radius of digraphs with given diameter

This page was built for publication: Sharp bounds on the generalized distance spectral radius and generalized distance energy of strongly connected digraphs