AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (470.5 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

On very strongly perfect Cartesian product graphs

Ganesh Gandal1( )R Mary Jeya Jothi1Narayan Phadatare2
Department of Mathematics, Sathyabama Institute of Science and Technology, Chennai-600119, India
Department of Mathematics, Savitribai Phule Pune University, Pune-411007, India
Show Author Information

Abstract

Let G 1 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.

CLC number: 05C69, 05C38, 05C40

References

【1】
【1】
 
 
AIMS Mathematics
Pages 2634-2645

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Gandal G, Jothi RMJ, Phadatare N. On very strongly perfect Cartesian product graphs. AIMS Mathematics, 2022, 7(2): 2634-2645. https://doi.org/10.3934/math.2022148

0

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 29 April 2021
Accepted: 05 November 2021
Published: 15 February 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)