Maximum and second maximum indices of t C₃^--free unbalanced signed graphs
From MaRDI portal
Publication:7353739
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A note on eigenvalues of signed graphs
- Biased graphs. I: Bias, balance, and gains
- Bounding the largest eigenvalue of signed graphs
- Complete signed graphs with largest maximum or smallest minimum eigenvalue
- Extremal results for \(\mathcal{K}^-_{r+1}\)-free unbalanced signed graphs.
- Extremal results for \(C_3^-\)-free signed graphs
- Extremal spectral results related to spanning trees of signed complete graphs
- scientific article; zbMATH DE number 7157359 (Why is no real title available?)
- On the notion of balance of a signed graph
- Ordering signed graphs with large index
- Signed graphs
- Signed graphs with maximal index
- Spectral criterion for cycle balance in networks
- Spectral Tur\'{a}n problem for $\mathcal{K}_5^{-}$-free signed graphs
- The index of signed graphs with forbidden subgraphs
- The largest eigenvalue of \(\mathcal{C}_k^-\)-free signed graphs
- The maximum index of signed complete graphs
- Turán problem for \(\mathcal{K}_4^-\)-free signed graphs
- Turán problem of signed graph for negative odd cycle
- Unbalanced signed graphs with extremal spectral radius or index
This page was built for publication: Maximum and second maximum indices of \(t \mathcal{C}_3^-\)-free unbalanced signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353739)