Connected signed graphs of fixed order, size, and number of negative edges with maximal index

DOI10.1080/03081087.2016.1265480zbMath1387.05156OpenAlexW2557657435MaRDI QIDQ4603751

Zoran Stanić, Tamara Koledin

Publication date: 19 February 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1265480

zbMATH Keywords

adjacency matrixlargest eigenvaluesigned graphsmall perturbationsnested graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (14)

Ordering signed graphs with large index ⋮ Unbalanced signed graphs with extremal spectral radius or index ⋮ Perturbations in a signed graph and its index ⋮ Bounding the largest eigenvalue of signed graphs ⋮ Complete signed graphs with largest maximum or smallest minimum eigenvalue ⋮ The index of signed graphs with forbidden subgraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the largest eigenvalue of signed unicyclic graphs ⋮ Signed graphs with maximal index ⋮ Signed complete graphs with maximum index ⋮ Maximizing the largest eigenvalues of signed unicyclic graphs ⋮ Extremal spectral results related to spanning trees of signed complete graphs ⋮ Some signed graphs whose eigenvalues are main

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial approach for computing the characteristic polynomial of a matrix
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• On the notion of balance of a signed graph
• Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2
• Inequalities for Graph Eigenvalues

This page was built for publication: Connected signed graphs of fixed order, size, and number of negative edges with maximal index