Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.00575

On Perrin Cordial Labeling: A New Approach in Graph Labeling Theory

Sarbari Mitra·Soumya Bhoumik
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we introduce the concept of \emph{Perrin cordial labeling}, a novel vertex labeling scheme inspired by the Perrin number sequence and situated within the broader framework of graph labeling theory. The Perrin numbers are defined recursively by the relation \( P_n = P_{n-2} + P_{n-3} \), with initial values \( P_0 = 0 \), \( P_1 = 3 \), and \( P_2 = 0 \). A Perrin cordial labeling of a graph \( G = (V, E) \) is an injective function \( f : V(G) \rightarrow \{P_0, P_1, \dots, P_n\} \), where the induced edge labeling \( f^* : E(G) \rightarrow \{0,1\} \) is given by \( f^*(uv) = (f(u) + f(v)) \pmod 2 \). The labeling is said to be cordial if the number of edges labeled \( 0 \), denoted \( e_f(0) \), and the number labeled \( 1 \), denoted \( e_f(1) \), satisfy the condition \( |e_f(0) - e_f(1)| \leq 1 \). A graph that admits such a labeling is called a \emph{Perrin cordial graph}. This study investigates the existence of Perrin cordial labelings in various families of graphs by analyzing their structural properties and compatibility with the proposed labeling scheme. Our results aim to enrich the theory of graph labelings and highlight a new connection between number theory and graph structures.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarbari Mitra, Soumya Bhoumik. 2025-11-01. On Perrin Cordial Labeling: A New Approach in Graph Labeling Theory. https://arxiv.org/abs/2511.00575

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗