Constant Sum Group Flows of Graphs

Author:

Wang Tao-Ming1ORCID

Affiliation:

1. Department of Applied Mathematics, Tunghai University, Taichung 40704, Taiwan

Abstract

As an analogous concept of a nowhere-zero flow for directed graphs, zero-sum flows and constant-sum flows are defined and studied in the literature. For an undirected graph, a zero-sum flow (constant-sum flow resp.) 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 (constant h resp.), and we call it a zero-sum k-flow (h-sum k-flow resp.) if the values of the edges are less than k. We extend these concepts to general constant-sum A-flow, where A is an Abelian group, and consider the case A=Zk the additive Abelian cyclic group of integer congruences modulo k with identity 0. In the literature, a graph is alternatively called Zk-magic if it admits a constant-sum Zk-flow, where the constant sum is called a magic sum or an index for short. We define the set of all possible magic sums such that G admits a constant-sum Zk-flow to be Ik(G) and call it the magic sum spectrum, or for short, the index set of G with respect to Zk. In this article, we study the general properties of the magic sum spectrum of graphs. We determine the magic sum spectrum of complete bipartite graphs Km,n for m≥n≥2 as the additive cyclic subgroups of Zk generated by kd, where d=gcd(m−n,k). Also, we show that every regular graph G with a perfect matching has a full magic sum spectrum, namely, Ik(G)=Zk for all k≥3. We characterize a 3-regular graph so that it admits a perfect matching if and only if it has a full magic sum spectrum, while an example is given for a 3-regular graph without a perfect matching which has no full magic sum spectrum. Another example is given for a 5-regular graph without a perfect matching, which, however, has a full magic sum spectrum. In particular, we completely determine the magic sum spectra for all regular graphs of even degree. As a byproduct, we verify a conjecture raised by Akbari et al., which claims that every connected 4k-regular graph of even order admits a 1-sum 4-flow. More open problems are included.

Funder

National Science and Technology Council of Taiwan

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference22 articles.

1. Magic valuations of finite graphs;Kotzig;Canad. Math. Bull.,1970

2. Characterization of magic graphs;Jezny;Czechoslov. Math. J.,1983

3. On a generalization of magic graphs, in Combinatorics (Eger 1987);Sadorovand;Colloq. Math. Soc. Janos Bolyai,1988

4. Trenkler, M. (1982, January 24–27). Some results on magic graphs. Proceedings of the Conference: Graphs and OtherCombinatorial Topics, Prague, Czech Republic.

5. Disconnected graphs with magic labelings;Jeurissen;Discrete Math.,1983

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3