On graphs whose star sets are (co-)cliques
From MaRDI portal
Publication:958038
DOI10.1016/j.laa.2008.08.013zbMath1168.05324OpenAlexW2011005472MaRDI QIDQ958038
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.08.013
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On independent star sets in finite graphs ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On edge star sets in trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximal index of graphs with a prescribed number of edges
- On graphs with multiple eigenvalues
- Nonregular graphs with three eigenvalues
- Which graphs are determined by their spectrum?
- A study of eigenspaces of graphs
- Some additions to the theory of star partitions of graphs
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
This page was built for publication: On graphs whose star sets are (co-)cliques