Orthogonal double covers of complete graphs by certain spanning subgraphs

被引：0
|
作者：
El-Shanawany, R. [1 ]
Higazy, M. Sh. [1 ]
机构：
[1] Minoufiya Univ, Fac Elect Engn, Dept Phys & Engn Math, Shibin Al Kawm, Egypt
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2008年 / 42卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An orthogonal double cover (ODC) of a complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we construct ODCs of K-n where all graphs are isomorphic to certain spanning subgraphs G (such as co-triangles, a star with co-triangles, and two other graph classes).
引用
收藏
页码：223 / 228
页数：6
相关论文
共 50 条
  • [1] Orthogonal double covers of complete graphs by trees
    Gronau, HDOF
    Mullin, RC
    Rosa, A
    GRAPHS AND COMBINATORICS, 1997, 13 (03) : 251 - 262
  • [2] Orthogonal Double Covers of Complete Graphs by Trees
    H. -D. O. F. Gronau
    R. C. Mullin
    A. Rosa
    Graphs and Combinatorics, 1997, 13 : 251 - 262
  • [3] Orthogonal double covers of complete bipartite graphs
    Sampathkumar, R.
    Simarinca, M.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2011, 49 : 15 - 18
  • [4] Cyclic orthogonal double covers of complete graphs by some complete multipartite graphs
    Sampathkumar, R.
    Srinivasan, S.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 69 : 183 - 189
  • [5] On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
    El-Mesady, Ahmed
    Farahat, Tasneem
    El-Shanawany, Ramadan
    Romanov, Aleksandr Y.
    ALGORITHMS, 2023, 16 (07)
  • [6] More orthogonal double covers of complete graphs by Hamiltonian paths
    Hartmann, Sven
    Leck, Uwe
    Leck, Volker
    DISCRETE MATHEMATICS, 2008, 308 (12) : 2502 - 2508
  • [7] Orthogonal double covers of complete graphs by caterpillars of diameter 5
    Froncek, Dalibor
    GRAPHS AND COMBINATORICS, 2007, 23 (02) : 145 - 163
  • [8] Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5
    Dalibor Froncek
    Graphs and Combinatorics, 2007, 23 : 145 - 163
  • [9] Orthogonal double covers of complete graphs by trees of small diameter
    Discrete Appl Math, 1-3 (377-388):
  • [10] Orthogonal double covers of complete graphs by trees of small diameter
    Leck, U
    Leck, V
    DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 377 - 388
12345