The connected forcing connected vertex detour number of a graph | Zendy

A. P. Santhakumaran | Zendy; P. Titus | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The connected forcing connected vertex detour number of a graph

Author(s) -

A. P. Santhakumaran,

P. Titus

Publication year - 2011

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1558

Subject(s) - combinatorics , vertex connectivity , vertex (graph theory) , mathematics , connectivity , induced subgraph , graph , connected component , discrete mathematics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research