EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

TOTAL VERTEX COVER OF GRAPHS

Aziz B. Tapeing, Sergio R. Canoy Jr.

Far East Journal of Mathematical Sciences (FJMS) · 12.08.2026 · 143 (10) · 3441-3459

DOI: 10.17654/0972087126186 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 12.08.2026. Verfasst von Aziz B. Tapeing und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A vertex cover $S\subseteq V(G)$ is called a total vertex cover of $G$ if the graph $\langle S \rangle$ induced by set $S$ does not contain isolated vertices, i.e., $ | N_G(v) \cap S | \ge 1$ for every $v \in S$. The total vertex cover number of $G$, denoted by $\beta_t(G)$, is the minimum cardinality of a total vertex covering of $G$. In this paper, we show that given two positive integers $a$ and $b$ such that $2 \le a \le b$, there exist a connected graph $G$ such that $\gamma _t(G) = a$ and $\beta_t(G) = b$, where $\gamma _t(G)$ is the total domination number of $G$. We also characterize the total vertex covers of the join, corona, edge corona, and lexicographic product of two graphs. From these characterizations, we determine a bound or the exact value of the total vertex cover number of each of these graphs.

Zitieren

APA

Tapeing, A. B., & Jr., S. R. C. (2026). TOTAL VERTEX COVER OF GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(10), 3441-3459. https://doi.org/10.17654/0972087126186

Vancouver

Tapeing AB, Jr. SRC. TOTAL VERTEX COVER OF GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(10):3441-3459. doi:10.17654/0972087126186

BibTeX
@article{Tapeing2026,
  author = {Tapeing, Aziz B. and Jr., Sergio R. Canoy},
  title = {TOTAL VERTEX COVER OF GRAPHS},
  journal = {Far East Journal of Mathematical Sciences (FJMS)},
  year = {2026},
  volume = {143},
  number = {10},
  pages = {3441--3459},
  doi = {10.17654/0972087126186}
}
Kostenlos starten →