A characterization of signed graphs represented by root system \(D_ \infty\)

DOI10.1016/S0195-6698(13)80037-6zbMath0764.05090OpenAlexW2016085883MaRDI QIDQ1814086

G. R. Vijayakumar, P. D. Chawathe

Publication date: 25 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80037-6

zbMATH Keywords

root systemssigraphminimal forbidden sigraphssymmetry of sigraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (7)

Characterizations of line graphs in signed and gain graphs ⋮ Representation of signed graphs by root system \(E_ 8\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Open problems in the spectral theory of signed graphs ⋮ Oriented gain graphs, line graphs and eigenvalues ⋮ Extremal spectral results related to spanning trees of signed complete graphs ⋮ From finite line graphs to infinite derived signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Signed graphs represented by \(D_{\infty}\)
• Graphs with eigenvalues at least - 2
• Orbits under actions of affine groups over GF(2)
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• Generalized line graphs
• The interchange graph of a finite graph
• Characterizations of derived graphs

This page was built for publication: A characterization of signed graphs represented by root system \(D_ \infty\)