A Novel Problem to Solve the Logically Labeling of Corona between Paths and Cycles

Ashraf ELrokh, Mohammed M. Ali Al-Shamiri, Atef Abd El-hay and M. T. Rahim

Journal of Mathematics, 2022, vol. 2022, 1-11

Abstract: In this study, we propose a new kind of graph labeling which we call logic labeling and investigate the logically labeling of the corona between paths Pn and cycles Cn, namely, Pn⊙Cm. A graph is said to be logical labeling if it has a 0−1 labeling that satisfies certain properties. The corona G1⊙G2 of two graphs G1 (with n1 vertices and m1 edges) and G2 (with n2 vertices and m2 edges) is defined as the graph formed by taking one copy of G1 and n1 copies of G2 and then connecting the ith vertex of G1 with an edge to every vertex in the ith copy of G2.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/2312206.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/2312206.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2312206

DOI: 10.1155/2022/2312206

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().