Some characterizations of graphs by star complements

DOI10.1016/S0024-3795(99)00179-2zbMath0945.05042OpenAlexW2076234506WikidataQ127109489 ScholiaQ127109489MaRDI QIDQ1970508

Peter Rowlinson, Slobodan K. Simic, Dragos Cvetković

Publication date: 8 October 2000

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(99)00179-2

zbMATH Keywords

eigenvalueadjacency matrixgeneralized line graphroot graphstar complements

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (16)

Maximal graphs with a prescribed complete bipartite graph as a star complement ⋮ On joins of a clique and a co-clique as star complements in regular graphs ⋮ On the characterization of graphs by star complements ⋮ Regular and maximal graphs with prescribed tripartite graph as a star complement ⋮ The maximal exceptional graphs ⋮ Unnamed Item ⋮ Maximal signed graphs with odd signed cycles as star complements ⋮ Star complements in regular graphs: old and new results ⋮ Regular graphs with a prescribed complete multipartite graph as a star complement ⋮ Graphs with least eigenvalue \(-2\): The star complement technique ⋮ On graphs with prescribed star complements ⋮ Slobodan Simić: an appreciation ⋮ A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6) ⋮ Star complements and switching in graphs ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Star complements and edge-connectivity in finite graphs

This page was built for publication: Some characterizations of graphs by star complements