VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH
Global and Stochastic Analysis · 2025
DOI: 10.64837/gsa.12.6.1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Global and Stochastic Analysis, 2025. Verfasst von M. Perumalsamy und 3 weiteren Autor:innen.
Abstract (Originalsprache)
A geodetic set S ⊆ V in a simple graph G = (V, E), which intersects every minimum vertex covering set (α0-set), is called a vertex covering transversal geodetic set [7]. The minimum cardinality of a vertex covering transversal geodetic set of G is called the vertex covering transversal geodetic number of G and is denoted by gvct(G) [7]. A partition (S1, S2, ..., Sk) of V is called a vertex covering transversal geodomatic partition of G if each Si is a vertex covering transversal geodetic set in G. The maximum cardinality of a vertex covering transversal geodomatic partition of G is called the vertex covering transversal geodomatic number of G and is denoted by dgvct (G). In this paper, we investigate the parameter known as the vertex covering transversal geodomatic number for different types of graphs and examine its structural properties.
Zitieren
APA
Perumalsamy, M., asanthi, R., Gnanakumar, M., & Duraikannan, J. (2025). VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH. Global and Stochastic Analysis. https://doi.org/10.64837/gsa.12.6.1
Vancouver
Perumalsamy M, asanthi R, Gnanakumar M, Duraikannan J. VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH. Global and Stochastic Analysis. 2025. doi:10.64837/gsa.12.6.1
BibTeX
@article{Perumalsamy2025,
author = {Perumalsamy, M. and asanthi, R.V and Gnanakumar, M. and Duraikannan, J.},
title = {VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH},
journal = {Global and Stochastic Analysis},
year = {2025},
doi = {10.64837/gsa.12.6.1}
}
EUVIMED