On independent star sets in finite graphs
From MaRDI portal
Publication:2437349
Recommendations
Cites work
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- scientific article; zbMATH DE number 3326519 (Why is no real title available?)
- Bounds on codes over an alphabet of five elements
- Classification algorithms for codes and designs
- Co-cliques and star complements in extremal strongly regular graphs
- Enumeration of Symmetric Designs (25,9,3)
- Error-correcting codes over an alphabet of four elements
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- On graphs whose star sets are (co-)cliques
- Relations between \((\kappa ,\tau )\)-regular sets and star complements.
- Some additions to the theory of star partitions of graphs
- Spectra of graphs
Cited in
(7)- Graphs with least eigenvalue \(-2\): ten years on
- Dominating properties of star complements
- scientific article; zbMATH DE number 1529454 (Why is no real title available?)
- On bipartite graphs with complete bipartite star complements
- On graphs whose star sets are (co-)cliques
- On joins of a clique and a co-clique as star complements in regular graphs
- 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)