Properly even harmonious labelings of disconnected graphs

A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree, exactly one label may be used on two vertices...

Full description

Bibliographic Details
Main Authors: Joseph A. Gallian, Danielle Stewart
Format: Article
Language:English
Published: Taylor & Francis Group 2015-11-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S0972860015000420

Similar Items