The total double geodetic number of a graph
Author
Santhakumaran, A. P.
Jebaraj, T.
Abstract
For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The mínimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. A total double geodetic set of a graph G is a double geodetic set S such that the subgraph G[S] induced by S has no isolated vertices. The minimum cardinality of a total double geodetic set of G is the total double geodetic number of G and is denoted by dgt(G). For positive integers r, d and k ≥ 4 with r ≤ d ≤ 2r, there exists a connected graph G with rad G = r, diam G = d and dgt(G) = k. It is shown that if n, a, b are positive integers such that 4 ≤ a ≤ b ≤ n, then there exists a connected graph G of order n with dgt(G) = a and dgc(G) = b. Also, for integers a, b with 4 ≤ a ≤ b and b ≤ 2a, there exists a connected graph G such that dg(G) = a and dgt(G) = b.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
On the upper geodetic global domination number of a graph
Xaviour, X. Lenin; Chellathurai, S. Robinson. Proyecciones (Antofagasta, On line); Vol. 39 No. 6 (2020); 1627-1646 -
The edge-to-edge geodetic domination number of a graph
John, J.; Sujin Flower, V.. Proyecciones (Antofagasta, On line); Vol. 40 No. 3 (2021); 635-658 -
THE IMPORTANCE OF THE GEODETIC OBSERVATORY TIGO FOR GEOREFERENTIATION
Hase,Hayo. Gayana (Concepción) v.68 n.2 suppl.TIProc 2004