Turán problem for K₄^--free signed graphs
From MaRDI portal
Publication:6994396
Cites work
- A sharp upper bound of the spectral radius of graphs
- Bounding the largest eigenvalue of signed graphs
- Bounds on graph eigenvalues. II
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Eigenvalues and chromatic number of a signed graph
- Eine Extremalaufgabe aus der Graphentheorie.
- Extremal results for \(C_3^-\)-free signed graphs
- On the largest eigenvalue of signed unicyclic graphs
- On the notion of balance of a signed graph
- Open problems in the spectral theory of signed graphs
- Signed graphs
- Signed spectral Turań-type theorems
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral bounds for the clique and independence numbers of graphs
Cited in
(4)- On the maximal index of unbalanced signed graphs with a prescribed number of edges
- The largest eigenvalue of \(\mathcal{C}_k^-\)-free signed graphs
- The index of unbalanced signed complete graphs whose negative-edge-induced subgraph is \(K_{2,2}\)-minor free
- Maximum and second maximum indices of \(t \mathcal{C}_3^-\)-free unbalanced signed graphs
This page was built for publication: Turán problem for \(\mathcal{K}_4^-\)-free signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994396)