2011•Discussiones Mathematicae Graph TheoryRequires access

The connected forcing connected vertex detour number of a graph

A. P. Santhakumaran, P. Titus

Abstract

For any vertex x in a connected graph G of order p � 2, a set S of vertices of V is an x-detour set of G if each vertex v in G lies on an x-y detour for some element y in S. A connected x-detour set of G is an x-detour set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected x-detour set of G is the connected x-detour number of G and is denoted by cdx(G). For

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Combinatorics, Vertex connectivity, Vertex (graph theory), Mathematics, Connectivity, Induced subgraph, Graph, Connected component