Extremal spectral results related to spanning trees of signed complete graphs
From MaRDI portal
Publication:2099487
Recommendations
Cites work
- scientific article; zbMATH DE number 398956 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A characterization of signed graphs represented by root system \(D_ \infty\)
- Biased graphs. I: Bias, balance, and gains
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Distance spectra of graphs: a survey
- On the distance spectrum of graphs
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- On the notion of balance of a signed graph
- Signed complete graphs with maximum index
- Signed distance in signed graphs
- Signed graphs
- Signed graphs represented by \(D_{\infty}\)
- Signed graphs with least eigenvalue \(<-2\)
- Signed graphs with maximal index
Cited in
(4)- The Existence of an Alternating Sign on a Spanning Tree of Graphs
- Complete signed graphs with largest maximum or smallest minimum eigenvalue
- On the least eigenvalues of unbalanced signed bicyclic graphs with given girth
- Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
This page was built for publication: Extremal spectral results related to spanning trees of signed complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099487)