Complete bipartite graph is a totally irregular total graph

Complete bipartite graph is a totally irregular total graph

<p class="p1"><span>A graph G is called a totally irregular total </span><span class="math inline"><em>k</em></span><span>-graph if it has a totally irregular total k-labeling </span><span class="math inline">&...

Full description

Bibliographic Details
Main Authors: Meilin I. Tilukay, Pranaya D. M. Taihuttu, A. N. M. Salman, Francis Y. Rumlawang, Zeth A. Leleury
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 2021-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
complete bipartite graph, total irregularity strength, totally irregular total labeling
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/453

Internet

https://www.ejgta.org/index.php/ejgta/article/view/453

Similar Items