3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph

Rizwan Ullah, Gul Rahmat, Muhammad Numan, Kraidi Anoh Yannick, Adnan Aslam and Elena Guardo

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: Let G be a simple graph with vertex set VG and edge set EG. An edge labeling δ:EG⟶0,1,…,p−1, where p is an integer, 1≤p≤EG, induces a vertex labeling δ∗:VH⟶0,1,…,p−1 defined by δ∗v=δe1δe2⋅δenmodp, where e1,e2,…,en are edges incident to v. The labeling δ is said to be p-total edge product cordial (TEPC) labeling of G if eδi+vδ∗i−eδj+vδ∗j≤1 for every i,j, 0≤i≤j≤p−1, where eδi and vδ∗i are numbers of edges and vertices labeled with integer i, respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/1724687.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/1724687.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:1724687

DOI: 10.1155/2021/1724687

Access Statistics for this article

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