2002Unpublished venueRequires access

On self-clique graphs with prescribed clique sizes

F. Larrión, V. Neumann-lara, Miguel Pizaña, Thomas Dale Porter

Open publisher page 6 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Clique graph, Combinatorics, Split graph, Block graph, Clique-sum, Mathematics, Simplex graph, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
On self-clique graphs with prescribed clique sizes — Research Paper | ScholarLens