EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

On Fibonacci Cordial Labeling of Some Snake Graphs

Jolina E. Sulayman, Ariel C. Pedrano

European Journal of Mathematics and Statistics · 31.03.2023 · 4 (2) · 29-35

DOI: 10.24018/ejmath.2023.4.2.193 ↗

Kurz gefasst

Fachartikel in der Zeitschrift European Journal of Mathematics and Statistics, online erschienen am 31.03.2023. Verfasst von Jolina E. Sulayman und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Sulayman, J. E., & Pedrano, A. C. (2023). On Fibonacci Cordial Labeling of Some Snake Graphs. European Journal of Mathematics and Statistics, 4(2), 29-35. https://doi.org/10.24018/ejmath.2023.4.2.193

Vancouver

Sulayman JE, Pedrano AC. On Fibonacci Cordial Labeling of Some Snake Graphs. European Journal of Mathematics and Statistics. 2023;4(2):29-35. doi:10.24018/ejmath.2023.4.2.193

BibTeX
@article{Sulayman2023,
  author = {Sulayman, Jolina E. and Pedrano, Ariel C.},
  title = {On Fibonacci Cordial Labeling of Some Snake Graphs},
  journal = {European Journal of Mathematics and Statistics},
  year = {2023},
  volume = {4},
  number = {2},
  pages = {29--35},
  doi = {10.24018/ejmath.2023.4.2.193}
}
Kostenlos starten →