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...

Full description

Bibliographic Details
Main Authors: Håkan Lennerstad, Mattias Eriksson
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 2018-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/379