Zero-sum magic labelings and null sets of regular graphs (Q405209): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Summary: For every \(h\in \mathbb{N}\), a graph \(G\) with the vertex set \(V(G)\) and the edge set \(E(G)\) is said to be \(h\)-magic if there exists a labeling \(l : E(G) \to\mathbb{Z}_h \setminus \{0\}\) such that the induced vertex labeling \(s : V (G) \to \mathbb{Z}_h\), defined by \(s(v) =\sum_{uv \in E(G)} l(uv)\) is a constant map. When this constant is zero, we say that \(G\) admits a zero-sum \(h\)-magic labeling. The null set of a graph \(G\), denoted by \(N(G)\), is the set of all natural numbers \(h \in \mathbb{ N} \) such that \(G\) admits a zero-sum \(h\)-magic labeling. In 2012, the null sets of 3-regular graphs were determined. In this paper we show that if \(G\) is an \(r\)-regular graph, then for even \(r\) (\(r > 2\)), \(N(G)=\mathbb{N}\) and for odd \(r\) (\(r\neq5\)), \(\mathbb{N} \setminus \{2,4\}\subseteq N(G)\). Moreover, we prove that if \(r\) is odd and \(G\) is a \(2\)-edge connected \(r\)-regular graph (\(r\neq 5\)), then \( N(G)=\mathbb{N} \setminus \{2\}\). Also, we show that if \(G\) is a \(2\)-edge connected bipartite graph, then \(\mathbb{N} \setminus \{2,3,4,5\}\subseteq N(G)\). | |||
Property / review text: Summary: For every \(h\in \mathbb{N}\), a graph \(G\) with the vertex set \(V(G)\) and the edge set \(E(G)\) is said to be \(h\)-magic if there exists a labeling \(l : E(G) \to\mathbb{Z}_h \setminus \{0\}\) such that the induced vertex labeling \(s : V (G) \to \mathbb{Z}_h\), defined by \(s(v) =\sum_{uv \in E(G)} l(uv)\) is a constant map. When this constant is zero, we say that \(G\) admits a zero-sum \(h\)-magic labeling. The null set of a graph \(G\), denoted by \(N(G)\), is the set of all natural numbers \(h \in \mathbb{ N} \) such that \(G\) admits a zero-sum \(h\)-magic labeling. In 2012, the null sets of 3-regular graphs were determined. In this paper we show that if \(G\) is an \(r\)-regular graph, then for even \(r\) (\(r > 2\)), \(N(G)=\mathbb{N}\) and for odd \(r\) (\(r\neq5\)), \(\mathbb{N} \setminus \{2,4\}\subseteq N(G)\). Moreover, we prove that if \(r\) is odd and \(G\) is a \(2\)-edge connected \(r\)-regular graph (\(r\neq 5\)), then \( N(G)=\mathbb{N} \setminus \{2\}\). Also, we show that if \(G\) is a \(2\)-edge connected bipartite graph, then \(\mathbb{N} \setminus \{2,3,4,5\}\subseteq N(G)\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6340184 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
magic labeling | |||
Property / zbMATH Keywords: magic labeling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
null set | |||
Property / zbMATH Keywords: null set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
zero-sum flows | |||
Property / zbMATH Keywords: zero-sum flows / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regular graph | |||
Property / zbMATH Keywords: regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartite graph | |||
Property / zbMATH Keywords: bipartite graph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zero-sum flows in regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on zero-sum 5-flows in regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 0-sum and 1-sum flows in regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factors and factorizations of graphs—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On zero-sum \({\mathbb{Z}_k}\)-magic labelings of 3-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4860774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factors of regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5310237 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3537749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3567482 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4117859 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nowhere-zero 6-flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear homogeneous Diophantine equations and magic labelings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Magic labelings of graphs, symmetric magic squares, systems of parameters, and Cohen-Macaulay rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2723258 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:49, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Zero-sum magic labelings and null sets of regular graphs |
scientific article |
Statements
Zero-sum magic labelings and null sets of regular graphs (English)
0 references
4 September 2014
0 references
Summary: For every \(h\in \mathbb{N}\), a graph \(G\) with the vertex set \(V(G)\) and the edge set \(E(G)\) is said to be \(h\)-magic if there exists a labeling \(l : E(G) \to\mathbb{Z}_h \setminus \{0\}\) such that the induced vertex labeling \(s : V (G) \to \mathbb{Z}_h\), defined by \(s(v) =\sum_{uv \in E(G)} l(uv)\) is a constant map. When this constant is zero, we say that \(G\) admits a zero-sum \(h\)-magic labeling. The null set of a graph \(G\), denoted by \(N(G)\), is the set of all natural numbers \(h \in \mathbb{ N} \) such that \(G\) admits a zero-sum \(h\)-magic labeling. In 2012, the null sets of 3-regular graphs were determined. In this paper we show that if \(G\) is an \(r\)-regular graph, then for even \(r\) (\(r > 2\)), \(N(G)=\mathbb{N}\) and for odd \(r\) (\(r\neq5\)), \(\mathbb{N} \setminus \{2,4\}\subseteq N(G)\). Moreover, we prove that if \(r\) is odd and \(G\) is a \(2\)-edge connected \(r\)-regular graph (\(r\neq 5\)), then \( N(G)=\mathbb{N} \setminus \{2\}\). Also, we show that if \(G\) is a \(2\)-edge connected bipartite graph, then \(\mathbb{N} \setminus \{2,3,4,5\}\subseteq N(G)\).
0 references
magic labeling
0 references
null set
0 references
zero-sum flows
0 references
regular graph
0 references
bipartite graph
0 references
0 references