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

DOI10.22108/toc.2020.120375.1689zbMath1474.05168OpenAlexW3036899106MaRDI QIDQ4997218

No author found.

Publication date: 28 June 2021

Full work available at URL: https://toc.ui.ac.ir/article_24517_97a6195eb2729b9bbe843c44360c7b64.pdf

zbMATH Keywords

regular graphstrong product graphszero-sum flowcategorical product of graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Total edge irregularity strength of generalized prism
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Zero-sum flows in regular graphs
• On zero-sum 6-flows of graphs
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Constant Sum Flows in Regular Graphs
• Zero-Sum Flow Numbers of Triangular Grids
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Total Domination in Categorical Products of Graphs
• Zero-Sum Flow Numbers of Hexagonal Grids
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Zero-sum flow number of categorical and strong product of graphs