The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The connected forcing connected vertex detour number of a graph”

Concerning connectedness im kleinen and a related property

R. Moore (1922)

Fundamenta Mathematicae

Similarity:

Sierpinski has shown (Wacław Sierpiński Sur une condition pour qu'un continu soit une courbe jordanienne, Fundamenta Mathematicae I (1920), pp. 44-60) that in order that a closed and connected set of points M should be a continuous curve it is necessary and sufficient that, for every positive number ϵ, the connected point-set M should be the sum of a finite number of closed and connected point-sets each of diameter less than ϵ. It follows that, as applied to point-sets which are closed,...

On the doubly connected domination number of a graph

Joanna Cyman, Magdalena Lemańska, Joanna Raczek (2006)

Open Mathematics

Similarity:

For a given connected graph G = (V, E), a set D ⊆ V ( G ) is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number. We investigate several properties of doubly connected dominating sets and give some bounds on the doubly connected domination number.

Perfect connected-dominant graphs

Igor Edmundovich Zverovich (2003)

Discussiones Mathematicae Graph Theory

Similarity:

If D is a dominating set and the induced subgraph G(D) is connected, then D is a connected dominating set. The minimum size of a connected dominating set in G is called connected domination number γ c ( G ) of G. A graph G is called a perfect connected-dominant graph if γ ( H ) = γ c ( H ) for each connected induced subgraph H of G.We prove that a graph is a perfect connected-dominant graph if and only if it contains no induced path P₅ and induced cycle C₅.