F-Centroidal Mean Labelling of Trees and Cycle Related Graphs

Document Type : Primary Research paper

Authors

1 Assistant Professor, Department of Mathematics, Bishop Heber College, Tiruchirappalli- 620017, Tamil Nadu, India

2 Assistant Professor, Department of Mathematics, Srimad Andavan Arts and Science, Tiruchirappalli-620007, College, Tamil Nadu, India.

Abstract

In this paper, we have discussed the F–centroidal Mean Labelling of tree and cycle
related graphs. A function f is called an F–centroidal mean labelling of a graph G(V,E)
with p vertices and q edges if f :V(G)1,2,3,...........,q 1 is injective and the induced
function f : E(G)1,2,3,...........,q  defined as
 
  




 
 
3 ( ) ( )
2 ( ) ( ) ( ) ( )
( )
2 2
f u f v
f u f u f v f v
f uv ,
for all uvE(G) , is bijective. A graph that admits an F–centroidal mean labelling is called
an F–centroidal mean graph.

Keywords

Int. J. of Aquatic Science
Volume 12, Issue 2 - Serial Number 2
June 2021
Pages 3623-3632

Files

Share

How to cite

Statistics