STRONG (WEAK) NEIGHBOURHOOD COVERING SETS OF A GRAPH
Print ISSN: 0972-7752 | Online ISSN: 2582-0850 | Total Downloads : 60
DOI: https://doi.org/10.56827/SEAJMMS.2024.2002.3
Author :
Anusha L. (Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal - 576104, INDIA)
Sayinath Udupa N. V. (Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal - 576104, INDIA)
Surekha R. Bhat (Department of Mathematics, Milagres College, Kallianpur - 576105, Udupi, INDIA)
Prathviraj N. (Manipal School of Information Sciences, Manipal Academy of Higher Education, Manipal - 576104, INDIA)
Abstract
The ve-degree of a vertex $u \in V(G)$, denoted by $d_{ve}(u)$, is the number of edges in the subgraph $\langle N[u] \rangle$. A vertex $u$ is said to n-cover (neighbourhood-cover) an edge $e$ if $e$ is an edge of the subgraph $\langle N[u] \rangle$. A set $S\subseteq V(G)$ is called a n-covering set of a graph $G$ if every edge in $G$ is n-covered by some vertex in $S$. The n-covering number $\alpha_{n}(G)$ is the minimum cardinality of a n-covering set of $G$. In this paper, we introduce new parameters such as strong (weak) n-covering number and strong (weak) n-independence number using ve-degrees of vertices, and we establish a relationship between them. Further, we define and study n-cover balanced sets.
Keywords and Phrases
ve-degree, n-cover, strong n-covering number, n-cover balanced graph.
A.M.S. subject classification
05C07, 05C69, 05C70.
.....
