- Celal Bayar Üniversitesi Fen Bilimleri Dergisi
- Vol: 13 Issue: 2
- Independence Saturation In Complementary Product Types of Graphs
Independence Saturation In Complementary Product Types of Graphs
Authors : Zeynep Nihan Berberler, Murat Erşen Berberler
Pages : 325-331
Doi:10.18466/cbayarfbe.319783
View : 14 | Download : 11
Publication Date : 2017-06-30
Article Type : Research
Abstract :The independence saturation number of a graph is defined as , where is the maximum cardinality of an independent set that contains vertex . Let be the complement graph of . Complementary prisms are the subset of complementary product graphs. The complementary prism of is the graph formed from the disjoint union of and by adding the edges of a perfect matching between the corresponding vertices of and . In this paper, the independence saturation in complementary prisms are considered, then the complementary prisms with small independence saturation numbers are characterized.Keywords : Complementary prisms, graph theory, independence, independence saturation, network topology