On very strongly perfect Cartesian product graphs
Keyword(s):
<abstract><p>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.</p></abstract>
2011 ◽
Vol 84
(1)
◽
pp. 171-176
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
1991 ◽
Vol 90
(3)
◽
pp. 297-311
◽
Keyword(s):
2007 ◽
Vol 28
◽
pp. 33-40
◽
2014 ◽
Vol 06
(01)
◽
pp. 1450001
◽
2019 ◽
Vol 12
(2)
◽
pp. 499-505
Keyword(s):