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>,...
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-10-01
|
| Serie: | Electronic Journal of Graph Theory and Applications |
| Soggetti: | |
| Accesso online: | http://www.ejgta.org/index.php/ejgta/article/view/453 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|