Event Title

Group-Antimagic Labeling of a Class of Graphs

Graduation Year

2017

Location

Center for Natural Sciences, Illinois Wesleyan University

Start Date

18-4-2015 9:00 AM

End Date

18-4-2015 10:00 AM

Description

For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0} such that the labels induced on the vertices given by the sums of the labels of the edges incident to each vertex are all distinct. For a given graph G, the integer antimagic spectrum is the set of all integers k for which G is Zk-antimagic. This project focuses on characterizing the integer antimagic spectrum for a class of graphs called closed helms. Our method consists of applying previous results on the existence of Zk-antimagic labelings of subgraphs of closed helms, and extending these labelings to include the remaining edges.

This document is currently not available here.

Share

COinS
 
Apr 18th, 9:00 AM Apr 18th, 10:00 AM

Group-Antimagic Labeling of a Class of Graphs

Center for Natural Sciences, Illinois Wesleyan University

For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0} such that the labels induced on the vertices given by the sums of the labels of the edges incident to each vertex are all distinct. For a given graph G, the integer antimagic spectrum is the set of all integers k for which G is Zk-antimagic. This project focuses on characterizing the integer antimagic spectrum for a class of graphs called closed helms. Our method consists of applying previous results on the existence of Zk-antimagic labelings of subgraphs of closed helms, and extending these labelings to include the remaining edges.