Cliques and Supercliques in Graphs

Authors

  • Sergio Canoy , Jr. Mindanao State University-Iligan Institute of Technology
  • Ramil Dela Cerna Mindanao State University-Iligan Institute of Technology
  • Armalene Abragan Mindanao State University-Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4651

Keywords:

clique, clique number, superclique, superclique number

Abstract

A set S ⊆ V (G) of an undirected graph G is a clique if every two distinct vertices in S are adjacent. A clique is a superclique if for every pair of distinct vertices v, w ∈ S, there exists u ∈ V (G) \ S such that u ∈ NG(v) \ NG(w) or u ∈ NG(w) \ NG(v). The maximum cardinality of a clique (resp. superclique) in G is called the clique (resp. superclique) number of G. In this paper, we determine the clique and superclique numbers of some graphs.

Downloads

Published

2023-01-29

Issue

Section

Nonlinear Analysis

How to Cite

Cliques and Supercliques in Graphs. (2023). European Journal of Pure and Applied Mathematics, 16(1), 243-252. https://doi.org/10.29020/nybg.ejpam.v16i1.4651