Open AccessOn very strongly perfect Cartesian product graphs
Author(s) -
Ganesh Gandal,
R. Mary Jeya Jothi,
Narayan Phadatare
Publication year - 2022
Publication title -
aims mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 15
ISSN - 2473-6988
DOI - 10.3934/math.2022148
Subject(s) - cartesian product , cartesian coordinate system , graph , mathematics , combinatorics , graph product , discrete mathematics , product (mathematics) , computer science , chordal graph , 1 planar graph , geometry
Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and characterize the co-strongly perfect graph. The very strongly perfect graph is implemented in the real-time application of a wireless sensor network to optimize the set of master nodes to communicate and control nodes placed in the field.