Certified Vertex Cover of a Graph
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i2.5157Keywords:
certified set, vertex cover, certified vertex covering set, certified vertex cover numberAbstract
Let $G$ be a graph. Then $Q \subseteq V(G)$ is called a certified vertex covering set of G if $Q$ is a vertex cover of $G$ and every $x \in Q$, $x$ has zero or at least two neighbors in $V(G)\setminus Q$. The certified vertex cover number of $G$, denoted by $\beta_{cer}(G)$, is the minimum cardinality of a certified vertex cover of $G$. In this paper, we investigate this parameter on some special graphs and on the join of two graphs. We characterize certified vertex covering sets in these graphs and we use these results to derive the simplified formulas for solving the said parameter. Moreover, we present some bounds and properties of this parameter.
Downloads
Published
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
![Creative Commons License](http://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.