The null set of the join of paths

For positive integer k, a graph G is said to be k-magic if the edges of G can be labeled with the nonzero elements of Abelian group ℤ k, where ℤ 1= ℤ (the set of integers) and ℤ k is the group of integers mod k≥ 2, so that the sum of the labels of the edges incident to any vertex of G is the same. W...

Full description

Saved in:

Bibliographic Details
Main Authors:	Eniego, Arnold A, Garces, Ian June L
Format:	text
Published:	Archīum Ateneo 2019
Subjects:	Join of paths k-magic graphs null set zero-sum k-magic labeling Mathematics
Online Access:	https://archium.ateneo.edu/mathematics-faculty-pubs/122 https://www.worldscientific.com/doi/abs/10.1142/S1793557119500608
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Ateneo De Manila University

id	ph-ateneo-arc.mathematics-faculty-pubs-1121
record_format	eprints
spelling	ph-ateneo-arc.mathematics-faculty-pubs-11212020-07-10T06:22:17Z The null set of the join of paths Eniego, Arnold A Garces, Ian June L For positive integer k, a graph G is said to be k-magic if the edges of G can be labeled with the nonzero elements of Abelian group ℤ k, where ℤ 1= ℤ (the set of integers) and ℤ k is the group of integers mod k≥ 2, so that the sum of the labels of the edges incident to any vertex of G is the same. When this constant sum is 0, we say that G is a zero-sum k-magic graph. The set of all k for which G is a zero-sum k-magic graph is the null set of G. In this paper, we will completely determine the null set of the join of a finite number of paths. 2019-01-01T08:00:00Z text https://archium.ateneo.edu/mathematics-faculty-pubs/122 https://www.worldscientific.com/doi/abs/10.1142/S1793557119500608 Mathematics Faculty Publications Archīum Ateneo Join of paths k-magic graphs null set zero-sum k-magic labeling Mathematics
institution	Ateneo De Manila University
building	Ateneo De Manila University Library
country	Philippines
collection	archium.Ateneo Institutional Repository
topic	Join of paths k-magic graphs null set zero-sum k-magic labeling Mathematics
spellingShingle	Join of paths k-magic graphs null set zero-sum k-magic labeling Mathematics Eniego, Arnold A Garces, Ian June L The null set of the join of paths
description	For positive integer k, a graph G is said to be k-magic if the edges of G can be labeled with the nonzero elements of Abelian group ℤ k, where ℤ 1= ℤ (the set of integers) and ℤ k is the group of integers mod k≥ 2, so that the sum of the labels of the edges incident to any vertex of G is the same. When this constant sum is 0, we say that G is a zero-sum k-magic graph. The set of all k for which G is a zero-sum k-magic graph is the null set of G. In this paper, we will completely determine the null set of the join of a finite number of paths.
format	text
author	Eniego, Arnold A Garces, Ian June L
author_facet	Eniego, Arnold A Garces, Ian June L
author_sort	Eniego, Arnold A
title	The null set of the join of paths
title_short	The null set of the join of paths
title_full	The null set of the join of paths
title_fullStr	The null set of the join of paths
title_full_unstemmed	The null set of the join of paths
title_sort	null set of the join of paths
publisher	Archīum Ateneo
publishDate	2019
url	https://archium.ateneo.edu/mathematics-faculty-pubs/122 https://www.worldscientific.com/doi/abs/10.1142/S1793557119500608
_version_	1681506744414502912

The null set of the join of paths

Similar Items