#### Filter Results:

#### Publication Year

1993

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We prove a necessary and sufficient condition under which a connected graph has a connected P 3-path graph. Moreover, an analogous condition for connectivity of the P k-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.

A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words S is dominating if the sets S ∩ N [u] where u ∈ V (G) and N [u] denotes the closed neighbourhood of u in G, are all nonempty. A set S ⊆ V (G) is called a locating code in G, if the sets S ∩ N [u] where u ∈ V (G) \ S are… (More)