Extremal spectral results related to spanning trees of signed complete graphs
From MaRDI portal
Publication:2099487
DOI10.1016/j.disc.2022.113250zbMath1504.05172OpenAlexW4309198319MaRDI QIDQ2099487
Dan Li, Huiqiu Lin, Ji Xiang Meng
Publication date: 23 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113250
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)
Related Items (2)
Complete signed graphs with largest maximum or smallest minimum eigenvalue ⋮ Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
Cites Work
- Unnamed Item
- Biased graphs. I: Bias, balance, and gains
- Signed graphs represented by \(D_{\infty}\)
- Signed graphs
- Signed graphs with least eigenvalue \(<-2\)
- A characterization of signed graphs represented by root system \(D_ \infty\)
- Signed graphs with maximal index
- Signed distance in signed graphs
- Distance spectra of graphs: a survey
- Signed complete graphs with maximum index
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- On the distance spectrum of graphs
- On the notion of balance of a signed graph
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
This page was built for publication: Extremal spectral results related to spanning trees of signed complete graphs
