Zero-sum flow number of categorical and strong product of graphs
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$ f...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Isfahan
2020-12-01
|
| Col·lecció: | Transactions on Combinatorics |
| Matèries: | |
| Accés en línia: | https://toc.ui.ac.ir/article_24517_97a6195eb2729b9bbe843c44360c7b64.pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|