@Article{JICS-5-243,
author = {Nasreen Khan, Madhumangal Pal and Anita Pal},
title = {( 2,1)-Total Labelling of Cactus Graphs},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {5},
number = {4},
pages = {243--260},
abstract = { A (2,1)-total labelling of a graph 
,
 is an assignment of integers to each vertex and 
edge such that: (i) any two adjacent vertices of  G  receive distinct integers, (ii) any two adjacent edges of  G  
receive distinct integers, and (iii) a vertex and its incident edge receive integers that differ by at least 2. The  
span of a (2,1)-total labelling is the maximum difference between two labels. The minimum span of a (2,1)-
total labelling of  G  is called the (2,1)-total number and denoted by 
 A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label 
that, 
the  vertices  and  edges  of  a  cactus  graph  by 
1
  
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22699.html}
}