%0 Journal Article
%T Zero-sum flow number of categorical and strong product of graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Rashid, Muhammad Aamer
%A Ahmad, Sarfraz
%A Hanif, Muhammad Farhan
%A Siddiqui, Muhammad Kamran
%A Naeem, Muhammad
%D 2020
%\ 12/01/2020
%V 9
%N 4
%P 181-199
%! Zero-sum flow number of categorical and strong product of graphs
%K Regular graph
%K zero-sum flow
%K categorical product of graphs
%K strong product graphs
%R 10.22108/toc.2020.120375.1689
%X 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.
%U https://toc.ui.ac.ir/article_24517_97a6195eb2729b9bbe843c44360c7b64.pdf