The detour hull number of a graph
For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted by ID[S]. A set S is a detour convex set if ID[S] = S. The detour convex hul...
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2012 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2012
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/152246 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | The detour hull number of a graph / A.P. Santhakumaran, S.V. Ullas Chandran // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 307–322. — Бібліогр.: 14 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
nasplib_isofts_kiev_ua-123456789-152246 |
|---|---|
| record_format |
dspace |
| spelling |
Santhakumaran, A.P. Ullas Chandran, S.V. 2019-06-09T06:15:01Z 2019-06-09T06:15:01Z 2012 The detour hull number of a graph / A.P. Santhakumaran, S.V. Ullas Chandran // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 307–322. — Бібліогр.: 14 назв. — англ. 1726-3255 2010 MSC:05C12. https://nasplib.isofts.kiev.ua/handle/123456789/152246 For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted by ID[S]. A set S is a detour convex set if ID[S] = S. The detour convex hull [S]D of S in G is the smallest detour convex set containing S. The detour hull number dh(G) is the minimum cardinality among the subsets S of V with [S]D = V. A set S of vertices is called a detour set if ID[S] = V. The minimum cardinality of a detour set is the detour number dn(G) of G. A vertex x in G is a detour extreme vertex if it is an initial or terminal vertex of any detour containing x. Certain general properties of these concepts are studied. It is shown that for each pair of positive integers r and s, there is a connected graph G with r detour extreme vertices, each of degree s. Also, it is proved that every two integers a and b with 2 ≤ a ≤ b are realizable as the detour hull number and the detour number respectively, of some graph. For each triple D, k and n of positive integers with 2 ≤ k ≤ n − D + 1 and D ≥ 2, there is a connected graph of order n, detour diameter D and detour hull number k. Bounds for the detour hull number of a graph are obtained. It is proved that dn(G) = dh(G) for a connected graph G with detour diameter at most 4. Also, it is proved that for positive integers a, b and k ≥ 2 with a < b ≤ 2a, there exists a connected graph G with detour radius a, detour diameter b and detour hull number k. Graphs G for which dh(G) = n − 1 or dh(G) = n − 2 are characterized. Research supported by DST Project No. SR/S4/MS: 319/06 en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics The detour hull number of a graph Article published earlier |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| title |
The detour hull number of a graph |
| spellingShingle |
The detour hull number of a graph Santhakumaran, A.P. Ullas Chandran, S.V. |
| title_short |
The detour hull number of a graph |
| title_full |
The detour hull number of a graph |
| title_fullStr |
The detour hull number of a graph |
| title_full_unstemmed |
The detour hull number of a graph |
| title_sort |
detour hull number of a graph |
| author |
Santhakumaran, A.P. Ullas Chandran, S.V. |
| author_facet |
Santhakumaran, A.P. Ullas Chandran, S.V. |
| publishDate |
2012 |
| language |
English |
| container_title |
Algebra and Discrete Mathematics |
| publisher |
Інститут прикладної математики і механіки НАН України |
| format |
Article |
| description |
For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted by ID[S]. A set S is a detour convex set if ID[S] = S. The detour convex hull [S]D of S in G is the smallest detour convex set containing S. The detour hull number dh(G) is the minimum cardinality among the subsets S of V with [S]D = V. A set S of vertices is called a detour set if ID[S] = V. The minimum cardinality of a detour set is the detour number dn(G) of G. A vertex x in G is a detour extreme vertex if it is an initial or terminal vertex of any detour containing x. Certain general properties of these concepts are studied. It is shown that for each pair of positive integers r and s, there is a connected graph G with r detour extreme vertices, each of degree s. Also, it is proved that every two integers a and b with 2 ≤ a ≤ b are realizable as the detour hull number and the detour number respectively, of some graph. For each triple D, k and n of positive integers with 2 ≤ k ≤ n − D + 1 and D ≥ 2, there is a connected graph of order n, detour diameter D and detour hull number k. Bounds for the detour hull number of a graph are obtained. It is proved that dn(G) = dh(G) for a connected graph G with detour diameter at most 4. Also, it is proved that for positive integers a, b and k ≥ 2 with a < b ≤ 2a, there exists a connected graph G with detour radius a, detour diameter b and detour hull number k. Graphs G for which dh(G) = n − 1 or dh(G) = n − 2 are characterized.
|
| issn |
1726-3255 |
| url |
https://nasplib.isofts.kiev.ua/handle/123456789/152246 |
| citation_txt |
The detour hull number of a graph / A.P. Santhakumaran, S.V. Ullas Chandran // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 307–322. — Бібліогр.: 14 назв. — англ. |
| work_keys_str_mv |
AT santhakumaranap thedetourhullnumberofagraph AT ullaschandransv thedetourhullnumberofagraph AT santhakumaranap detourhullnumberofagraph AT ullaschandransv detourhullnumberofagraph |
| first_indexed |
2025-12-01T04:11:46Z |
| last_indexed |
2025-12-01T04:11:46Z |
| _version_ |
1850859240555544576 |