{"title":"On zero sum-partition of Abelian groups into three sets and group distance magic labeling","authors":"S. Cichacz","doi":"10.26493/1855-3974.1054.FCD","DOIUrl":"https://doi.org/10.26493/1855-3974.1054.FCD","url":null,"abstract":"We say that a finite Abelian group Γ has the constant-sum-partition property into t sets (CSP ( t ) -property) if for every partition n = r 1 + r 2 + … + r t of n , with r i ≥ 2 for 2 ≤ i ≤ t , there is a partition of Γ into pairwise disjoint subsets A 1 , A 2 , …, A t , such that ∣ A i ∣ = r i and for some ν ∈ Γ , ∑ a ∈ A i a = ν for 1 ≤ i ≤ t . For ν = g 0 (where g 0 is the identity element of Γ ) we say that Γ has zero-sum-partition property into t sets (ZSP ( t ) -property). A Γ -distance magic labeling of a graph G = ( V , E ) with ∣ V ∣ = n is a bijection l from V to an Abelian group Γ of order n such that the weight w ( x ) = ∑ y ∈ N ( x ) l( y ) of every vertex x ∈ V is equal to the same element μ ∈ Γ , called the magic constant . A graph G is called a group distance magic graph if there exists a Γ -distance magic labeling for every Abelian group Γ of order ∣ V ( G )∣ . In this paper we study the CSP (3) -property of Γ , and apply the results to the study of group distance magic complete tripartite graphs.","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":"170 1","pages":"417-425"},"PeriodicalIF":0.8,"publicationDate":"2017-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73930804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distance spectrum of graph compositions","authors":"Indulal Gopalapillai","doi":"10.26493/1855-3974.103.E09","DOIUrl":"https://doi.org/10.26493/1855-3974.103.E09","url":null,"abstract":"The D -eigenvalues μ 1 , μ 2 , ..., μ p of a graph G are the eigenvalues of its distance matrix D and form the distance spectrum or the D -spectrum. In this paper we obtain the D -spectrum of the cartesian product if two distance regular graphs. The D -spectrum of the lexicographic product G [ H ] of two graphs G and H when H is regular is also obtained. The D -eigenvalues of the Hamming graphs Ham( d, n ) of diameter d and order n d and those of the C 4 nanotori, T k , m , C 4 , are determined.","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":"63 1","pages":"93-100"},"PeriodicalIF":0.8,"publicationDate":"2009-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73029369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How Long is the Future? Working with Life-limited and Life-threatened Children","authors":"E. Brown","doi":"10.1558/IMRE.V3I1.5","DOIUrl":"https://doi.org/10.1558/IMRE.V3I1.5","url":null,"abstract":"","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":"4 1","pages":"5-13"},"PeriodicalIF":0.8,"publicationDate":"2007-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86496002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}