On Fibonacci Cordial Labeling of Some Snake Graphs

Jolina E. Sulayman and Ariel C. Pedrano
Additional contact information
Jolina E. Sulayman: University of Southeastern Philippines, Philippines
Ariel C. Pedrano: University of Southeastern Philippines, Philippines

European Journal of Mathematics and Statistics, 2023, vol. 4, issue 2, 29-35

Abstract: Let an injective function f from vertex set V of a graph G to the set (F0, F1, F2, ..., Fn), where Fj is jth the Fibonacci number (j=0, 1, ..., n), is said to be Fibonacci cordial labeling if the induced function f* from the edge set E of graph G to the set {0,1} defined by f* (uv) = (f(u)+f(v)) (mod2) satisfies the condition |ef(0)- ef(1) ≤ 1, where ef(0) is the number of edges with label 0 and ef(1) is the number of edges with label 1. A graph which admits Fibonacci cordial labeling is called Fibonacci cordial graph.

Keywords: Graph labeling; Cordial labeling; Fibonacci cordial labeling (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
https://eu-opensci.org/index.php/ejmath/article/view/14193 Abstract page (text/html)
https://eu-opensci.org/index.php/ejmath/article/download/14193/3204 Full text (application/pdf)

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:epw:ejmath:v:4:y:2023:i:2:id:14193

DOI: 10.24018/ejmath.2023.4.2.193

Access Statistics for this article

More articles in European Journal of Mathematics and Statistics from European Open Science
Bibliographic data for series maintained by Support Team ().