Odd sum labeling of graphs obtained by duplicating any edge of some graphs
<p>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 label...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2015-10-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/133 |
| Summary: | <p>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.</p> |
|---|---|
| ISSN: | 2338-2287 |