On Cartesian products of orthogonal double covers
Summary: Let \(H\) be a graph on \(n\) vertices and \(\mathcal G\) a collection of \(n\) subgraphs of \(H\), one for each vertex, where \(\mathcal G\) is an orthogonal double cover (ODC) of \(H\) if every edge of \(H\) occurs in exactly two members of \(\mathcal G\) and any two members share an edge whenever the corresponding vertices are adjacent in \(H\) and share no edges whenever the corresponding vertices 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 by new disjoint unions of complete bipartite graphs.
- scientific article; zbMATH DE number 638683
- On well-covered Cartesian products
- Cartesian product of two symmetric starter vectors of orthogonal double covers
- On orthogonal double covers of graphs
- On orthogonal double covers of graphs
- Orthogonal covers by multiplication graphs
- scientific article; zbMATH DE number 1439445
- Orthogonal double covers of Cayley graphs
- scientific article; zbMATH DE number 808193
- On orthogonal double covers by trees
- On cyclic orthogonal double covers of circulant graphs by special infinite graphs
- Orthogonal double covers of complete bipartite graphs
- Orthogonal double covers of complete bipartite graphs by the union of a cycle and a star
- scientific article; zbMATH DE number 638683 (Why is no real title available?)
- Two-fold factorization of the complete bipartite graphs by infinite graph classes
- On the one edge algorithm for the orthogonal double covers
- Cartesian product of two symmetric starter vectors of orthogonal double covers
This page was built for publication: On Cartesian products of orthogonal double covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950009)