The edge geodetic vertex covering number of a graph
Abstract
For a connected graph G of order n ≥ 2, a set S ⊆V(G) is an edge geodetic vertex cover of G if S is both an edge geodetic set and a vertex covering set of G. The minimum cardinality of an edge geodetic vertex cover of G is defined as the edge geodetic vertex covering number of G and is denoted by g1α(G). Any edge geodetic vertex cover of cardinality g1α(G) is a g1α - set of G. Some general properties satisfied by edge geodetic vertex cover are studied. The edge geodetic vertex covering number of several classes of graphs are determined. Connected graphs of order n with edge geodetic vertex covering number 2 is characterized. A few realization results are given for the parameter g1α(G).
Copyright © 2021 J. Anne Mary Leema, V.M. Arul Flower Mary, P. Titus. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
J. A. M. Leema, V. M. A. F. Mary, P. Titus, The edge geodetic vertex covering number of a graph, J. Math. Comput. Sci. 11 (2021), 1728–1742. https://doi.org/10.28919/jmcs/5352
BibTeX
@article{Leema2021,
author = {Leema, J. Anne Mary and Mary, V.M. Arul Flower and Titus, P.},
title = {The edge geodetic vertex covering number of a graph},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {1728--1742},
doi = {10.28919/jmcs/5352}
}