On independent star sets in finite graphs

DOI10.1016/j.laa.2013.06.009zbMath1282.05150OpenAlexW2048605682MaRDI QIDQ2437349

Peter Rowlinson

Publication date: 3 March 2014

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

Full work available at URL: https://doi.org/10.1016/j.laa.2013.06.009

zbMATH Keywords

symmetric designeigenvaluestrongly regular grapherror-correcting codestar set

Mathematics Subject Classification ID

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

Related Items

On joins of a clique and a co-clique as star complements in regular graphs ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On bipartite graphs with complete bipartite star complements

Cites Work

• Spectra of graphs
• Classification algorithms for codes and designs
• Co-cliques and star complements in extremal strongly regular graphs
• On graphs whose star sets are (co-)cliques
• Relations between (κ, τ)-regular sets and star complements
• Enumeration of Symmetric Designs (25,9,3)
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• Some additions to the theory of star partitions of graphs
• Error-correcting codes over an alphabet of four elements
• Bounds on codes over an alphabet of five elements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item