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 |
| _version_ | 1818217400191942656 |
|---|---|
| author | S. Arockiaraj P. Mahalakshmi P. Namasivayam |
| author_facet | S. Arockiaraj P. Mahalakshmi P. Namasivayam |
| author_sort | S. Arockiaraj |
| collection | DOAJ |
| description | <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> |
| first_indexed | 2024-12-12T07:07:16Z |
| format | Article |
| id | doaj.art-e4c347244cfb40119de43e92ed318362 |
| institution | Directory Open Access Journal |
| issn | 2338-2287 |
| language | English |
| last_indexed | 2024-12-12T07:07:16Z |
| publishDate | 2015-10-01 |
| publisher | Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia |
| record_format | Article |
| series | Electronic Journal of Graph Theory and Applications |
| spelling | doaj.art-e4c347244cfb40119de43e92ed3183622022-12-22T00:33:42ZengIndonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), IndonesiaElectronic Journal of Graph Theory and Applications2338-22872015-10-013210.5614/ejgta.2015.3.2.847Odd sum labeling of graphs obtained by duplicating any edge of some graphsS. Arockiaraj0P. Mahalakshmi1P. Namasivayam2Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi, Tamil NaduDepartment of Mathematics, Kamaraj College of Engineering and Technology Virudhunagar, Tamil Nadu, IndiaDepartment of Mathematics, M.D.T. Hindu College, Tirunelveli, Tamilnadu<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>https://www.ejgta.org/index.php/ejgta/article/view/133odd sum labeling, odd sum graphs |
| spellingShingle | S. Arockiaraj P. Mahalakshmi P. Namasivayam Odd sum labeling of graphs obtained by duplicating any edge of some graphs Electronic Journal of Graph Theory and Applications odd sum labeling, odd sum graphs |
| title | Odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| title_full | Odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| title_fullStr | Odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| title_full_unstemmed | Odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| title_short | Odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| title_sort | odd sum labeling of graphs obtained by duplicating any edge of some graphs |
| topic | odd sum labeling, odd sum graphs |
| url | https://www.ejgta.org/index.php/ejgta/article/view/133 |
| work_keys_str_mv | AT sarockiaraj oddsumlabelingofgraphsobtainedbyduplicatinganyedgeofsomegraphs AT pmahalakshmi oddsumlabelingofgraphsobtainedbyduplicatinganyedgeofsomegraphs AT pnamasivayam oddsumlabelingofgraphsobtainedbyduplicatinganyedgeofsomegraphs |