Signed line graphs with least eigenvalue -2: the star complement technique
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1161287 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- scientific article; zbMATH DE number 3412695 (Why is no real title available?)
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Eigenspaces of graphs
- Glossary of signed and gain graphs and allied areas
- Graphs with least eigenvalue \(-2\): The star complement technique
- Matrices in the theory of signed simple graphs
- On the Laplacian coefficients of signed graphs
- The eigenspace of the eigenvalue -2 in generalized line graphs and a problem in security of statistical databases
Cited in
(16)- Characterizations of line graphs in signed and gain graphs
- On connected signed graphs with rank equal to girth
- Some regular signed graphs with only two distinct eigenvalues
- Notes on exceptional signed graphs
- Constructing signed strongly regular graphs via star complement technique
- On eigenvalue multiplicity in signed graphs
- Line graphs of complex unit gain graphs with least eigenvalue \(-2\)
- Signed graphs whose spectrum is bounded by \(- 2\)
- Ordering of bicyclic signed digraphs by energy
- On eigenspaces of some compound complex unit gain graphs
- Star complements for \(\pm 2\) in signed graphs
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- On eigenspaces of some compound signed graphs
- Polynomial reconstruction of signed graphs whose least eigenvalue is close to \(-2\)
- Gain-line graphs via \(G\)-phases and group representations
- A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type \(\mathbb{A}_n\)
This page was built for publication: Signed line graphs with least eigenvalue -2: the star complement technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290095)