Loading...
Loading...

Go to the content (press return)

On the geodetic and the hull numbers in strong product graphs

Author
Cáceres, J.; Hernando, M.; Mora, M.; Pelayo, I. M.; Puertas, M. Luz
Type of activity
Journal article
Journal
Computers & mathematics with applications
Date of publication
2010-12
Volume
60
Number
11
First page
3020
Last page
3031
DOI
https://doi.org/10.1016/j.camwa.2010.10.001 Open in new window
Repository
http://hdl.handle.net/2117/11103 Open in new window
URL
http://www.elsevier.com/wps/find/journaldescription.cws_home/301/description#description Open in new window
Abstract
A set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, 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 minimum cardinality of a geodetic and a minimum hu...
Citation
Cáceres, J. [et al.]. On the geodetic and the hull numbers in strong product graphs. "Computers & mathematics with applications", Desembre 2010, vol. 60, núm. 11, p. 3020-3031.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants