Abstract
A set of vertices of a graph is a geodetic set of if every vertex lies on a shortest path between two vertices of . The minimum cardinality of a geodetic set of is the geodetic number of and it is denoted by . A Steiner set of is a set of vertices of such that every vertex of belongs to the set of vertices of a connected subgraph of minimum size containing the vertices of . The minimum cardinality of a Steiner set of is the Steiner number of and it is denoted by . Let and be two graphs and let be the order of . The corona product is defined as the graph obtained from and by taking one copy of and copies of and joining by an edge each vertex from the -copy of with the -vertex of . We study the geodetic number and the Steiner number of corona product graphs. We show that if is a connected graph of order and is a non complete graph, then , which partially solve the open problem presented in [\emph{Discrete Mathematics} \textbf{280} (2004) 259--263] related to characterize families of graphs satisfying that .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.