# Zero-sum flow number of categorical and strong product of graphs

Document Type : Research Paper

Authors

1 Department of Mathematics, COMSATS University Islamabad, Lahore Campus, 54000, Pakistan

2 Department of Mathematics COMSATS University Islamabad, Lahore Campus, 54000, Pakistan

3 Department of Mathematics, The University of Okara, Pakistan

10.22108/toc.2020.120375.1689

Abstract

A zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum $k$-flow if the absolute values of edges are less than $k$. We define the zero-sum flow number of $G$ as the least integer $k$ for which $G$ admitting a zero sum $k$-flow.?
In this paper we gave complete zero-sum flow and zero sum numbers for categorical and strong product of two graphs namely cycle and paths.

Keywords

Main Subjects