This article is cited in 2 papers

Applied Graph Theory

On the one edge algorithm for the orthogonal double covers

R. El-Shanawany, A. El-Mesady

Menoufia University, Menouf, Egypt

Abstract: The existing problem of the orthogonal double covers of the graphs is well-known in the theory of combinatorial designs. In this paper, a new technique called the one edge algorithm for constructing the orthogonal double covers of the complete bipartite graphs by copies of a graph is introduced. The advantage of this algorithm is that it is accessible to discrete mathematicians not intimately familiar with the theory of the orthogonal double covers.

Keywords: graph decomposition, symmetric starter, orthogonal double covers.

UDC: 519.1

Language: English

DOI: 10.17223/20710410/45/8

Bibliographic databases:

•