On classes of neighborhood resolving sets of a graph

On classes of neighborhood resolving sets of a graph

<p>Let <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> be a simple connected graph. A subset <span class="math"><em>S</em></span> of <span class="math"><em>V</em...

Full description

Bibliographic Details
Main Authors: B. Sooryanarayana, Suma A. S.
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:
resolving set, neighbourhood set, neighbourhood resolving sets.
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/249

Internet

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

Similar Items