Tribonacci Product Cordial Labeling on Some Basic Graphs
Year: 2024
Type: article
Abstract: Bala et.al., discussed the concept of Tribonacci Product Cordial Labeling [1]. An injective function δ :R(G)→{T1,T2, …Tm } is said to be Tribonacci product cordial labelling if the induced function δ*: B(G)→{0,1} defined by δ* (ri rj )=(δ(ri )δ(rj ))(mod2) satisfies the condition | bδ * (0)-bδ * (1)|≤1. A graph which admits Tribonacci Product cordial labelling is called Tribonacci product cordial graph. In this paper we investigate the existence of Tribonacci product cordial labelling for Wheel related graphs.
Authors: S. BALA, V. SUGANYA, K. THIRUSANGU
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6930464824
FWCI:
Cites:
Cited by:
Related to: