On inclusive distance vertex irregular labelings

On inclusive distance vertex irregular labelings

<p>For a simple graph <span class="math"><em>G</em></span>, a vertex labeling <span class="math"><em>f</em> : <em>V</em>(<em>G</em>) → {1, 2, ..., <em>k</em>}</span> is called a <span cla...

Full description

Bibliographic Details
Main Authors: Martin Baca, Andrea Semanicova-Fenovcikova, S. Slamin, Kiki A. Sugeng
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:
inclusive distance vertex irregular labeling, inclusive distance vertex irregularity strength
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/463

Internet

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

Similar Items