QR Code

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"><em>λ</em> : <em>V</em> ∪ <em>E</em>→</span><span> </span><span>1, 2, ... , k</span><span>,...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Meilin I. Tilukay, Pranaya D. M. Taihuttu, A. N. M. Salman, Francis Y. Rumlawang, Zeth A. Leleury
Format: Artigo
Langue:Inglês
Publié: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-10-01
Collection:Electronic Journal of Graph Theory and Applications
Sujets:
Accès en ligne:http://www.ejgta.org/index.php/ejgta/article/view/453
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!