An upper bound for the largest singular value of extended mixed graphs

DOI10.1016/J.EXCO.2025.100188MaRDI QIDQ6933155zbMATH OpenFDO

Authors Zoran Stanić

Publication date 5 September 2025

Published in Examples and Counterexamples (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EXCO.2025.100188

zbMATH Keywords

adjacency matrixeigenvalueLaplacian matrixmixed graphoriented graphsigned graphsingular value

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A new upper bound for the Laplacian spectral radius of graphs
• Bounding the largest eigenvalue of signed graphs
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• Inequalities for Graph Eigenvalues
• Oriented gain graphs, line graphs and eigenvalues
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)

This page was built for publication: An upper bound for the largest singular value of extended mixed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933155)