Weakly clique irreducibility of NEPS of two graphs

Authors

  • Aparna Lakshmanan S.
  • Vijayakumar A.
  • Wang, Tao-Ming

Abstract

A clique of a graph G is essential if it has an edge which does not belong to any other clique in G. A graph G is weakly clique irreducible if every edge in G belongs to at least one essential clique in G and is weakly clique reducible, otherwise. The closure property of weakly clique irreducible and reducible graphs under the noncomplete extended p-sums (NEPS) of two graphs are studied.

Published

2013-09-09

How to Cite

Aparna Lakshmanan S., Vijayakumar A., & Wang, Tao-Ming. (2013). Weakly clique irreducibility of NEPS of two graphs. Utilitas Mathematica, 92. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/920

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.