Add to ORKGAbstract: Let be a graph on n vertices and C a collection of n subgraphs of H, one for each vertex. Then C is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of C and any two members of C share a unique edge whenever the corresponding vertices are adjacent in H. If all subgraphs in C are isomorphic to a given graph , then C is said to be an ODC of H by G. We construct ODCs of H by the union of a path and a star, where the center of the star is one of the path end-vertices, for M=5,6,7,8,9,10). All these ODCs are generated by symmetric starters with respect to the cyclic group of order n
Abstract: We are concerned with the Cartesian products of two symmetric starter vectors of orthogon...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...
Abstract: Let be a graph on n vertices and C a collection of n subgraphs of H, one for each verte...
Abstract: Let be a graph on n vertices and C a collection of n subgraphs of H, one for each verte...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G i...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G i...
An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spann...
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vert...
A collection P of n spanning subgraphs of the complete graph Kn is said to be an Orthogonal Double C...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an ...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, ...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vert...
AbstractAn orthogonal double cover (ODC) of a graph H is a collection G={Gv:v∈V(H)} of |V(H)| subgra...
Abstract: We are concerned with the Cartesian products of two symmetric starter vectors of orthogon...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...
Abstract: Let be a graph on n vertices and C a collection of n subgraphs of H, one for each verte...
Abstract: Let be a graph on n vertices and C a collection of n subgraphs of H, one for each verte...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G i...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G i...
An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spann...
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vert...
A collection P of n spanning subgraphs of the complete graph Kn is said to be an Orthogonal Double C...
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an ...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, ...
AbstractLet H be a graph on n vertices and G a collection of n subgraphs of H, one for each vert...
AbstractAn orthogonal double cover (ODC) of a graph H is a collection G={Gv:v∈V(H)} of |V(H)| subgra...
Abstract: We are concerned with the Cartesian products of two symmetric starter vectors of orthogon...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...
Let X and G be graphs, such that G is isomorphic to a subgraph of X. An orthogonal double cover (ODC...