k-Product Cordial Labeling of Napier Bridge Graphs

Daisy, K. Jeya; Sabibha, R. Santrin; Jeyanthi, P.; Youssef, Maged Z.

doi:10.3126/njmathsci.v3i2.49201

Nep J. Math. Sci.

2022

DOI: 10.3126/njmathsci.v3i2.49201

|View full text |Cite

k-Product Cordial Labeling of Napier Bridge Graphs

K. Jeya Daisy¹,

R. Santrin Sabibha²,

P. Jeyanthi³

et al.

Abstract: See Full Text.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 5 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

k-Product cordial labeling of product of graphs

Daisy¹,

Sabibha

Jeyanthi³

et al. 2022

Discrete Math. Algorithm. Appl.

View full text Add to dashboard Cite

In 2012, Ponraj et al. defined k-product cordial labeling as follows: Let [Formula: see text] be a map from [Formula: see text] to [Formula: see text] where [Formula: see text] is an integer, [Formula: see text]. For each edge [Formula: see text] assign the label [Formula: see text] [Formula: see text]. [Formula: see text] is called a k-product cordial labeling if [Formula: see text], and [Formula: see text], [Formula: see text], where [Formula: see text] and [Formula: see text] denote the number of vertices and edges, respectively, labeled with [Formula: see text] [Formula: see text]. A graph that admits k-product cordial labeling is called k-product cordial graph. Later, we proved that several families of graphs are k-product cordial graphs. In this paper, we show that the product of graphs admit k-product cordial labeling.

show abstract

k-Product cordial labeling of product of graphs

Daisy¹,

Sabibha

Jeyanthi³

et al. 2022

Discrete Math. Algorithm. Appl.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

k-Product Cordial Labeling of Napier Bridge Graphs

Abstract: See Full Text.

Cited by 1 publication

References 5 publications

k-Product cordial labeling of product of graphs

k-Product cordial labeling of product of graphs

Contact Info

Product

Resources

About