List graphs and distance-consistent node labelings
<p>In this paper we consider node labelings c of an undirected connected graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> with labels <span class="math">{1, 2, ..., ∣<em>V</em>∣}</span>, which induce a list distance <span class="math"><em>c</em>(<em>u</em>, <em>v</em>) = ∣<em>c<...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Col·lecció: | Electronic Journal of Graph Theory and Applications |
| Matèries: | |
| Accés en línia: | http://www.ejgta.org/index.php/ejgta/article/view/379 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|