Contents

-

Nowhere-zero 3-flows in Tensor Products of Graphs

F.M. Dong1, E.G. Tay1, K.M. Koh2
1Mathematics and Mathematics Education National Institute of Education Nanyang Technological University, Singapore 637616
2Department of Mathematics National University of Singapore, Singapore 117543

Abstract

The tensor product of two graphs G1 and G2, denoted by G1×G2, is defined as the graph with vertex set {(x,y):xV(G1),yV(G2)} and edge set {(x1,y1)(x2,y2):x1x2E(G1),y1y2E(G2)}. Very recently, Zhang, Zheng, and Mamut showed that if δ(G1)2 and G2 does not belong to a well-characterized class G of graphs, then G1×G2 admits a nowhere-zero 3-flow. However, it remains unclear whether G1×G2 admits a nowhere-zero 3-flow if δ(G1)2 and G2 belongs to G, especially for the simplest case G2=K2. The main objective of this paper is to show that for any graph G with 2δ(G)Δ(G)3, G×K2 admits a nowhere-zero 3-flow if and only if either every cycle in G contains an even number of vertices of degree 2 or every cycle in G contains an even number of vertices of degree 3. We also extend the sufficiency of this result to graphs G×K2, where all odd vertices in G are of degree 3.