On cliques in edge-regular graphs
DOI10.1016/J.JALGEBRA.2014.08.028zbMATH Open1302.05082OpenAlexW1997996034MaRDI QIDQ468702FDOQ468702
Authors: Leonard H. Soicher 
Publication date: 7 November 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.08.028
Recommendations
- Edge-regular graphs with regular cliques
- On cliques in isoregular graphs
- scientific article; zbMATH DE number 19181
- On cliques in graphs
- The clique numbers of regular graphs
- Edge-clique graphs
- Another construction of edge-regular graphs with regular cliques
- Regular clique assemblies, configurations, and friendship in edge-regular graphs
- On a class of edge-regular graphs
- On the clique number of a strongly regular graph
maximum cliquestrongly regular graphcliquepartial geometryedge-regular graphHoffman boundDelsarte boundorbital graphquasiregular cliqueregular clique
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spreads in strongly regular graphs
- Combinatorics of optimal designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly regular graphs, partial geometries and partially balanced designs
- Block intersection polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- More on block intersection polynomials and new applications to graphs and block designs
Cited In (18)
- Designs over regular graphs with least eigenvalue \(-2\)
- Completely regular clique graphs. II
- Completely regular clique graphs
- Title not available (Why is that?)
- Edge clique graphs and some classes of chordal graphs
- On the clique number of a strongly regular graph
- Bounds for regular induced subgraphs of strongly regular graphs
- The smallest strictly Neumaier graph and its generalisations
- Title not available (Why is that?)
- A general construction of strictly Neumaier graphs and a related switching
- Upper bounds on the size of transitive subtournaments in digraphs
- Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
- On cliques in isoregular graphs
- Edge-clique graphs
- On the Existence of Small Strictly Neumaier Graphs
- Edge-regular graphs with regular cliques
- An infinite class of Neumaier graphs and non-existence results
- Another construction of edge-regular graphs with regular cliques
Uses Software
This page was built for publication: On cliques in edge-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468702)
