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

How to Cite

Canoy , Jr., S., Dela Cerna, R., & Abragan, A. (2023). Cliques and Supercliques in Graphs. European Journal of Pure and Applied Mathematics, 16(1), 243–252. https://doi.org/10.29020/nybg.ejpam.v16i1.4651

Issue

Vol. 16 No. 1: (January 2023)

Section

Nonlinear Analysis

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.

Funding data