On the geodetic and the hull numbers in strong product graphs

Details On the geodetic and the hull numbers in strong product graphs On the geodetic and the hull numbers in strong product graphs

2009-12-16

arxiv.org/abs/0912.3136v3

Mathematics

Combinatorics

22 pages, 9 figures

Scientific paper

A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S. The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex hull is V(G). The geodetic and the hull numbers of G are the cardinality of a minimum geodetic and a minimum hull set, respectively. In this work, we investigate the behavior of both geodetic and hull sets with respect to the strong product operation for graphs. We also stablish some bounds for the geodetic number and the hull number and obtain the exact value of these parameters for a number of strong product graphs.

Affiliated with

Also associated with

No associations

Rating

On the geodetic and the hull numbers in strong product graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the geodetic and the hull numbers in strong product graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the geodetic and the hull numbers in strong product graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49002