- Tytuł:
- The geodetic number of strong product graphs
- Autorzy:
-
Santhakumaran, A.
Ullas Chandran, S. - Powiązania:
- https://bibliotekanauki.pl/articles/744104.pdf
- Data publikacji:
- 2010
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
geodetic number
extreme vertex
extreme geodesic graph
open geodetic number
double domination number - Opis:
- For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices lying on u-v geodesics in G. Given a set S of vertices of G, the union of all sets $I_G[u,v]$ for u,v ∈ S is denoted by $I_G[S]$. A set S ⊆ V(G) is a geodetic set if $I_G[S] = V(G)$ and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong product graphs are obtainted and for several classes improved bounds and exact values are obtained.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2010, 30, 4; 687-700
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł