Extremal spectral results related to spanning trees of signed complete graphs
DOI10.1016/J.DISC.2022.113250zbMATH Open1504.05172OpenAlexW4309198319MaRDI QIDQ2099487FDOQ2099487
Authors: Dan Li, Huiqiu Lin, Jixiang 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)
Cites Work
- Signed graphs
- Distance spectra of graphs: a survey
- On the notion of balance of a signed graph
- Biased graphs. I: Bias, balance, and gains
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- On the distance spectrum of graphs
- Signed graphs represented by \(D_{\infty}\)
- Signed graphs with least eigenvalue \(<-2\)
- Title not available (Why is that?)
- A characterization of signed graphs represented by root system \(D_ \infty\)
- Signed distance in signed graphs
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Signed graphs with maximal index
- Signed complete graphs with maximum index
Cited In (4)
- The Existence of an Alternating Sign on a Spanning Tree of Graphs
- 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
- Complete signed graphs with largest maximum or smallest minimum eigenvalue
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)
