On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle

El-Shanawany, R. A. (2014) On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle. British Journal of Mathematics & Computer Science, 4 (16). pp. 2320-2325. ISSN 22310851

[thumbnail of El-Shanawany4162014BJMCS10724.pdf] Text
El-Shanawany4162014BJMCS10724.pdf - Published Version

Download (698kB)

Abstract

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 paper, we construct orthogonal double covers (ODCs) of complete bipartite graph Kn,n by d+1(F) and d(F).

Item Type: Article
Subjects: Institute Archives > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 29 Jun 2023 03:28
Last Modified: 18 Jan 2024 11:23
URI: http://eprint.subtopublish.com/id/eprint/2530

Actions (login required)

View Item
View Item