The geodetic number of the lexicographic product of graphs
From MaRDI portal
Publication:2275393
DOI10.1016/j.disc.2011.04.004zbMath1223.05253MaRDI QIDQ2275393
Boštjan Brešar, Tadeja Kraner Šumenjak, Aleksandra Tepeh Horvat
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.004
05C76: Graph operations (line graphs, products, etc.)
Related Items
Unnamed Item, The pre-hull number and lexicographic product, Strong geodetic problem in grid-like architectures, Toll number of the strong product of graphs, Toll number of the Cartesian and the lexicographic product of graphs, Geodesic transversal problem for join and lexicographic product of graphs, On the toll number of a graph, Geodetic convexity and Kneser graphs, Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs, Some Steiner concepts on lexicographic products of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the geodetic and the hull numbers in strong product graphs
- On the geodetic number of median graphs
- On the geodetic and geodetic domination numbers of a graph
- On the geodetic number and related metric sets in Cartesian product graphs
- The geodetic number of a graph
- On the geodetic number of a graph
- Geodetic Sets in Graphs
- Total domination in graphs
- Computational Complexity of Geodetic Set