TY - JOUR
T1 - Orthogonal double covers of complete graphs by lobsters of diameter 5
AU - Froncek, Dalibor
PY - 2008/8
Y1 - 2008/8
N2 - An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G = {Gi i = 1, 2,..., n} of spanning subgraphs of Kn, all isomorphic to G, with the property that every edge of Kn belongs to exactly two members of G and any two distinct members of G share exactly one edge. A lobster of diameter five is a tree arising from a double star by attaching any number of pendant vertices to each of its vertices of degree one. We show that for any double star R(p, q) there exists an ODC of Kn by all lobsters of diameter five (with finitely many possible exceptions) arising from R(p, q).
AB - An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G = {Gi i = 1, 2,..., n} of spanning subgraphs of Kn, all isomorphic to G, with the property that every edge of Kn belongs to exactly two members of G and any two distinct members of G share exactly one edge. A lobster of diameter five is a tree arising from a double star by attaching any number of pendant vertices to each of its vertices of degree one. We show that for any double star R(p, q) there exists an ODC of Kn by all lobsters of diameter five (with finitely many possible exceptions) arising from R(p, q).
KW - Orthogonal double cover
KW - Orthogonal labeling
UR - http://www.scopus.com/inward/record.url?scp=78651564155&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651564155&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:78651564155
SN - 0835-3026
VL - 66
SP - 129
EP - 134
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -