Odd Sum Labeling of Graphs Obtained by Duplicating Any Edge of Some Graphs
2015  //  DOI: 10.5614/ejgta.2015.3.2.8
S. Arockiaraj, P. Mahalakshmi, P. Namasivayam

Metrik

  • Eye Icon 167 kali dilihat
  • Download Icon 125 downloads
Metrics Icon 167 kali dilihat  //  125 downloads
Abstrak

An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=\{1,3,5,\dots,2q-1\}.$ A graph is said to be an odd sum graph if it admits an odd sum labeling. In this paper we study the odd sum property of graphs obtained by duplicating any edge of some graphs.

Full text
Show more arrow
 

Metrik

  • Eye Icon 167 kali dilihat
  • Download Icon 125 downloads
Metrics Icon 167 kali dilihat  //  125 downloads