TY - JOUR
T1 - The separated box product of two digraphs
AU - Potočnik, Primož
AU - Wilson, Steve
N1 - Publisher Copyright:
© 2016 Elsevier Ltd
PY - 2017/5/1
Y1 - 2017/5/1
N2 - A new product construction of graphs and digraphs, called the separated box product, is presented, and several of its properties are discussed. The construction is based on the standard box product of digraphs. However, unlike the standard box product, it preserves the valence of the factor digraphs: If every vertex in both factors has in-valence and out-valence k for some fixed k, then so does every vertex of the separated box product. Questions about the symmetries of the product and their relations to symmetries of the factor graphs are considered. An application of this construction to the case of tetravalent edge-transitive graphs is discussed in detail.
AB - A new product construction of graphs and digraphs, called the separated box product, is presented, and several of its properties are discussed. The construction is based on the standard box product of digraphs. However, unlike the standard box product, it preserves the valence of the factor digraphs: If every vertex in both factors has in-valence and out-valence k for some fixed k, then so does every vertex of the separated box product. Questions about the symmetries of the product and their relations to symmetries of the factor graphs are considered. An application of this construction to the case of tetravalent edge-transitive graphs is discussed in detail.
UR - http://www.scopus.com/inward/record.url?scp=85007071606&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85007071606&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2016.11.007
DO - 10.1016/j.ejc.2016.11.007
M3 - Article
AN - SCOPUS:85007071606
SN - 0195-6698
VL - 62
SP - 35
EP - 49
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
ER -