On some covering graphs of a graph

<p>For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\{u\in S : uv \in E(G) \}\cup \{v\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We def...

Full description

Bibliographic Details
Published in:Electronic Journal of Graph Theory and Applications
Main Authors: Shariefuddin Pirzada, Hilal A Ganie, Merajuddin Siddique
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 2016-10-01
Subjects:
covering graph, maximum degree, covering set, maximum degree minimum covering graph, covering number, independence number
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/166

Internet

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

Similar Items