On independent star sets in finite graphs
From MaRDI portal
Publication:2437349
DOI10.1016/J.LAA.2013.06.009zbMATH Open1282.05150OpenAlexW2048605682MaRDI QIDQ2437349FDOQ2437349
Authors: P. 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
Recommendations
Cites Work
- Spectra of graphs
- Title not available (Why is that?)
- Classification algorithms for codes and designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Title not available (Why is that?)
- Relations between \((\kappa ,\tau )\)-regular sets and star complements.
- Co-cliques and star complements in extremal strongly regular graphs
- On graphs whose star sets are (co-)cliques
- Some additions to the theory of star partitions of graphs
- Enumeration of Symmetric Designs (25,9,3)
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements
- Title not available (Why is that?)
Cited In (7)
- Dominating properties of star complements
- Title not available (Why is that?)
- On bipartite graphs with complete bipartite star complements
- On joins of a clique and a co-clique as star complements in regular graphs
- Graphs with least eigenvalue \(-2\): ten years on
- On graphs whose star sets are (co-)cliques
- Independent sets in association schemes
This page was built for publication: On independent star sets in finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437349)
