J. Andoyo

collaborators

5 papers

math.CO2026

On Arithmetic Cordial Labeling of Product Graphs

Jason D. Andoyo

Let $η$ be a fixed positive integer. Let $S$ be a subset of $Z$ , $⋆ : S \times S \to Z$ be a binary function, and $ζ_{η} : {ξ \in Z : g cd (ξ, η) = 1} \to {0, 1}$ …

math.CO2026

On Arithmetic Cordial Labeling of Some Graphs

Jason D. Andoyo, Jemina Clarisse C. Prudencio, Ricky F. Rulete

Let $I^\cdot$ be a fixed positive integer. Let $S$ be a subset of $Z$ , $⋆ : S \times S \to Z$ be a binary function, and $Î¶_Î·:\{Î¾\in \mathbb{Z}:\gcd(Î¾,Î·)=1\}\to \{…

math.CO2026

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

J. D. Andoyo

Let $p$ be an odd prime and let $F_{i}$ be the $i$ th $(a, b)$ -Fibonacci number with initial values $F_{0} = a$ and $F_{1} = b$ . For a simple connected graph $G = (V, E)$ , define a bijective func…

math.CO2025

On Legendre Cordial Labeling of Some Graphs Under Graph Opearations

Jason Andoyo

For a simple connected graph $G$ of order $n$ , a bijective function $f : V (G) \to {1, 2, \dots, n}$ is said to be a Legendre cordial labeling modulo $p$ , where $p$ is an odd prime, if…

math.CO2025

On Legendre Cordial Labeling of Complete Graphs

J. D. Andoyo

Let $p$ be an odd prime. For a simple connected graph $G$ of order $n$ , a bijective function $f : V (G) \to {1, 2, \dots, n}$ is said to be a Legendre cordial labeling modulo $p$ if the…