Show simple item record

The forcing connected detour number of a graph

dc.creatorSanthakumaran, A. P.
dc.creatorAthisayanathan, S.
dc.date2017-03-23
dc.date.accessioned2019-11-14T11:59:14Z
dc.date.available2019-11-14T11:59:14Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1284
dc.identifier10.4067/S0716-09172014000200002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113075
dc.descriptionFor two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u—v path in G.A u—v path of length D(u, v) is called a u—v detour. A set ⊆ V is called a detour set of G if every vertex in G lies on a detour joining a pair of vertices of S.The detour number dn(G) of G is the minimum order of its detour sets and any detour set of order dn(G) is a detour basis of G.A set ⊆ V is called a connected detour set of G if S is detour set of G and the subgraph G[S] induced by S is connected. The connected detour number cdn(G) of G is the minimum order of its connected detour sets and any connected detour set of order cdn(G) is called a connected detour basis of G.A subset T of a connected detour basis S is called a forcing subset for S if S is theuniquecon-nected detour basis containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing connected detour number of S, denoted by fcdn(S), is the cardinality of a minimum forcing subset for S. The forcing connected detour number of G, denoted by fcdn(G),is fcdn(G) = min{fcdn(S)},where the minimum is taken over all connected detour bases S in G. The forcing connected detour numbers ofcertain standard graphs are obtained. It is shown that for each pair a, b of integers with 0 ≤ a<b and b ≥ 3, there is a connected graph G with fcdn(G) = a and cdn(G) = b.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1284/996
dc.rightsDerechos de autor 2014 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 33 No 2 (2014); 147-155en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 33 Núm. 2 (2014); 147-155es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectDetoures-ES
dc.subjectconnected detour setes-ES
dc.subjectconnected detour basises-ES
dc.subjectconnected detour numberes-ES
dc.subjectforcing connected detour numberes-ES
dc.subjectdesvíoes-ES
dc.subjectconjunto de desvío conectadoes-ES
dc.subjectbase conectada de desvíoes-ES
dc.subjectnúmero de desvío conectadoes-ES
dc.subjectnúmero de desvío conectado forzado.es-ES
dc.titleThe forcing connected detour number of a graphes-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record