期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2015
卷号：12
期号：1
页码：59-63
DOI：10.1016/j.akcej.2015.06.009
语种：English
出版社：Elsevier
摘要：Abstract An orthogonal double cover (ODC) of a graph H is a collection G = { G v : v ∈ V ( H ) } of | V ( H ) | subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members G u and G v in G , | E ( G u ) ∩ E ( G v ) | is 1 if u and v are adjacent in H and it is 0 if u and v are nonadjacent in H . In this paper, we are concerned with the Cartesian product of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and using this method to construct ODCs for new graph classes.
