TRIBONACCI PRODUCT CORDIAL LABELING ON SOME BASIC GRAPHS
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.
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2024-12-10
- DOI
- https://doi.org/10.5281/zenodo.14332011
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00