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.
| Original language | English |
|---|---|
| Pages (from-to) | 181-199. |
| Journal | Transactions on Combinatorics |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2020 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2020 University of Isfahan. All Rights Reserved.
Keywords
- categorical product
- regular graph
- strong product
- zero-sum flow
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'ZERO-SUM FLOW NUMBER OF CATEGORICAL AND STRONG PRODUCT OF GRAPHS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver