Abstract
A set S of vertices in a connected graph [Formula: see text] is called a geodetic set if every vertex not in [Formula: see text] lies on a shortest path between two vertices from [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is called a dominating set of [Formula: see text] if every vertex not in [Formula: see text] has at least one neighbor in [Formula: see text]. A set [Formula: see text] is called a geodetic global dominating set of [Formula: see text] if [Formula: see text] is both geodetic and global dominating set of [Formula: see text]. The geodetic global domination number is the minimum cardinality of a geodetic global dominating set in [Formula: see text]. In this paper, we determine the geodetic global domination number of the corona and strong products of two graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have