201. The null set of the join of paths
- Author
-
Arnold A Eniego and Ian June L Garces
- Subjects
Computer Science::Information Retrieval ,General Mathematics ,010102 general mathematics ,Astrophysics::Instrumentation and Methods for Astrophysics ,Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) ,01 natural sciences ,Graph ,010101 applied mathematics ,Combinatorics ,Null set ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Integer ,ComputingMethodologies_DOCUMENTANDTEXTPROCESSING ,Computer Science::General Literature ,0101 mathematics ,Abelian group ,ComputingMilieux_MISCELLANEOUS ,Mathematics - Abstract
For positive integer [Formula: see text], a graph [Formula: see text] is said to be [Formula: see text]-magic if the edges of [Formula: see text] can be labeled with the nonzero elements of Abelian group [Formula: see text], where [Formula: see text] (the set of integers) and [Formula: see text] is the group of integers mod [Formula: see text], so that the sum of the labels of the edges incident to any vertex of [Formula: see text] is the same. When this constant sum is [Formula: see text], we say that [Formula: see text] is a zero-sum [Formula: see text]-magic graph. The set of all [Formula: see text] for which [Formula: see text] is a zero-sum [Formula: see text]-magic graph is the null set of [Formula: see text]. In this paper, we will completely determine the null set of the join of a finite number of paths.
- Published
- 2019
- Full Text
- View/download PDF