On self-clique graphs with prescribed clique sizes
F. Larrión, V. Neumann-lara, Miguel Pizaña, Thomas Dale Porter
Abstract
F. Larrión, V. Neumann-lara, Miguel Pizaña, Thomas Dale Porter
Abstract
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼ = K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼ = K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
Key concepts: Clique graph, Combinatorics, Split graph, Block graph, Clique-sum, Mathematics, Simplex graph, Discrete mathematics