TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES

DOI10.17654/DM018030385zbMath1386.05154OpenAlexW2736334317MaRDI QIDQ4639464

M. Sh. Higazy

Publication date: 9 May 2018

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm018030385

zbMATH Keywords

Cartesian productgraph decompositionsymmetric generatortwo fold factorization

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Orthogonal labeling for some different infinite graph classes

Cites Work

• Unnamed Item
• Cartesian product of two symmetric starter vectors of orthogonal double covers
• Orthogonal double covers of Cayley graphs
• Orthogonal double covers of complete graphs by trees
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• Orthogonal double covers of general graphs.
• On cyclic orthogonal double covers of circulant graphs by special infinite graphs
• On Cartesian products of orthogonal double covers
• Cyclic Orthogonal Double Covers of Circulants by Certain Nerve Cell Graphs.
• SUBORTHOGONAL DOUBLE COVERS OF THE COMPLETE BIPARTITE GRAPHS BY ALL BIPARTITE SUBGRAPHS WITH FIVE EDGES OVER FINITE GROUPS
• ORTHOGONAL DOUBLE COVERS OF COMPLETE BIPARTITE GRAPHS BY PATHS AND CYCLES
• On orthogonal double covers of graphs
• A textbook of graph theory

This page was built for publication: TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES