P4
1 article · search the full text for this term
-
Characterizing the Existence of P4
Abstract: In a graph G = (V, E) P4 denotes a path of length 4 vertices <v1, v2, v3, v4> such that there is no edge between either <v1, v3> or <v2, v4>. This exists either in graph G = (V, E) or its complement or both for which both G and the complement Gc are connected. In this article we give a proof for this property.
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 1, Issue 3, 2014 · pp. 39–41 Read article