On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle
R. A. El-Shanawany · Journal of Advances in Mathematics and Computer Science · 2014
Let F be a certain graph, the graph F-Path denoted by d+1(F) path of length d with d + 1 ver-tices (i.e. Every edge of this path is one-to-one corresponding to an isomorphic to the graph F). In the same manner, we define the graph F-Cycle as d(F) cycle on d vertices. In this pape...
Open access
Research Article
10.9734/BJMCS/2014/10724