Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

(a, b)-Fibonacci–Legendre Cordial Graphs and k-Pisano–Legendre Primes

View through CrossRef
Let p be an odd prime and let Fi be the it (a, b)-Fibonacci number with initial values F0 = a and F1 = b. For a simple connected graph G = (V, E), define a bijective function f : V (G) → {0, 1, . . . , |V | − 1}. If the induced function f∗ p: E(G) → {0, 1}, defined by f∗p(uv) = 1+([Ff(u)+Ff(v)]/p)2 whenever Ff(u) +Ff(v) ̸≡ 0(mod p) and f∗p(uv) = 0 whenever Ff(u) + Ff(v) ≡ 0(mod p), satisfies the condition |ef∗p(0)−ef∗p(1)| ≤ 1 where ef∗p(i) is the number of edges labeled i (i = 0, 1), then f is called (a, b)-Fibonacci-Legendre cordial labeling modulo p. In this paper, the (a, b)-Fibonacci-Legendre cordial labeling of path graphs, star graphs, wheel graphs, and graphs under the operations join, corona, lexicographic product, cartesian product, tensor product, and strong product is explored in relation to k-Pisano-Legendre primes relative to (a, b). We also present some properties of k-Pisano-Legendre primes relative to (a, b) and numerical observations on its distribution, leading to several conjectures concerning their density and growth behavior.
Title: (a, b)-Fibonacci–Legendre Cordial Graphs and k-Pisano–Legendre Primes
Description:
Let p be an odd prime and let Fi be the it (a, b)-Fibonacci number with initial values F0 = a and F1 = b.
For a simple connected graph G = (V, E), define a bijective function f : V (G) → {0, 1, .
.
.
, |V | − 1}.
If the induced function f∗ p: E(G) → {0, 1}, defined by f∗p(uv) = 1+([Ff(u)+Ff(v)]/p)2 whenever Ff(u) +Ff(v) ̸≡ 0(mod p) and f∗p(uv) = 0 whenever Ff(u) + Ff(v) ≡ 0(mod p), satisfies the condition |ef∗p(0)−ef∗p(1)| ≤ 1 where ef∗p(i) is the number of edges labeled i (i = 0, 1), then f is called (a, b)-Fibonacci-Legendre cordial labeling modulo p.
In this paper, the (a, b)-Fibonacci-Legendre cordial labeling of path graphs, star graphs, wheel graphs, and graphs under the operations join, corona, lexicographic product, cartesian product, tensor product, and strong product is explored in relation to k-Pisano-Legendre primes relative to (a, b).
We also present some properties of k-Pisano-Legendre primes relative to (a, b) and numerical observations on its distribution, leading to several conjectures concerning their density and growth behavior.

Related Results

Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
Exploring fibonacci cordiality in corona graphs
Exploring fibonacci cordiality in corona graphs
A Fibonacci cordial (FC) labeling of a graph G is an injective function f : V(G) → {F0, F1, …, Fn}, where Fi is the ith Fibonacci number, such that the induced edge labeling f*(uv)...
Some Properties of the Fibonacci Sequence
Some Properties of the Fibonacci Sequence
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...
Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I
Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I
The Fibonacci cube Γn is the subgraph of the hypercube Qn induced by vertices with no consecutive 1s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ter...
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
In the author's work [S. A. Annin, Attached primes over noncommutative rings, J. Pure Appl. Algebra212 (2008) 510–521], a theory of attached prime ideals in noncommutative rings wa...
Harmonic Mean Cordial Labeling of Some Known Graphs
Harmonic Mean Cordial Labeling of Some Known Graphs
All graphs considered in this paper are simple, finite, and undirected. A function f:V(G)→{1,2} is said to be a harmonic mean cordial labeling if the induced edge labeling f^*:E(G)...
Fibonacci Graphs
Fibonacci Graphs
Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibo...

Back to Top