On cliques in isoregular graphs
type: Item
instance of: scholarly article
title: On cliques in isoregular graphs
zbMATH Open document ID: 1236.05153
DOI: 10.1134/S1064562411040156
published in: Doklady Mathematics
publication date: 2012-01-17T00:00:00Z
review text: A graph \(\Gamma\) is called an edge-regular graph with parameters \((v,k,\lambda)\) if \(\Gamma\) is a regular graph of degree \(k\) on \(v\) vertices in which each edge lies in exactly \(\lambda\) triangles. The main results in this work are: {\parindent=8mm \begin{itemize}\item[(1)]if an edge-regular graph with parameters \(\left(4r^4 + 10r^3 + 6r^2 - 2r - 2, 2r^4 + 3r^3, r^4 - 2r^2 + r\right)\) contains a \(2r\)-clique then \(r = 1\); \item[(2)]if an edge-regular graph with parameters \(\left(2r^4 + 3r^3, r^4 - 2r^2 + r, \frac{r^4 - 2r^3 - 3r^2 + 6r}{2}\right)\) contains a \((2r-1)\)-clique then \(r = 1\) and \item[(3)]if an edge-regular graph with parameters \(\left(2r^4 + 5r^3 + 3r^2 - r - 1, r^4 + r^3 - r^2,\frac{r^4 - r^3 - 3r^2 + 3r}{2}\right)\) contains a \(2r\)-clique then \(r = 1\). \end{itemize}}
reviewed by: Mirko Lepović
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5998444
zbMATH Keywords: strongly regular graph, edge-regular graph
zbMATH Keywords: pseudo-geometric graph
author: Alexandre A. Makhnev
MaRDI profile type: MaRDI publication profile
cites work: Q4000288
cites work: Strongly regular graph with parameters \((486, 112, 36, 66)\) does not exist
cites work: On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
cites work: More on block intersection polynomials and new applications to graphs and block designs
description: scientific article; zbMATH DE number 5998444