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 labeling. I...
-д хадгалсан:
| Үндсэн зохиолчид: | , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2015-10-01
|
| Цуврал: | Electronic Journal of Graph Theory and Applications |
| Нөхцлүүд: | |
| Онлайн хандалт: | http://www.ejgta.org/index.php/ejgta/article/view/133 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|