On Clique Graphs and Clique Regular Graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Petro, Robert R., Phillips, Connor M.
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916628964311040
author Petro, Robert R.
Phillips, Connor M.
author_facet Petro, Robert R.
Phillips, Connor M.
contents If $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular, we find bounds on its eigenvalues (with exact results when $Γ$ is $k$-regular) and some complete classifications when $Γ$ is strongly regular. We apply our results to many examples, including Conway's 99-graph problem and the existence problem for other strongly regular graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2502_17845
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On Clique Graphs and Clique Regular Graphs
Petro, Robert R.
Phillips, Connor M.
Combinatorics
If $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular, we find bounds on its eigenvalues (with exact results when $Γ$ is $k$-regular) and some complete classifications when $Γ$ is strongly regular. We apply our results to many examples, including Conway's 99-graph problem and the existence problem for other strongly regular graphs.
title On Clique Graphs and Clique Regular Graphs
topic Combinatorics
url https://arxiv.org/abs/2502.17845