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...
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
-
Even harmonious labelings of disjoint graphs with a small component
by: Joseph A. Gallian, et al.
Published: (2015-11-01) -
Odd Harmonious Labeling of Some Classes of Graphs
by: P. Jeyanthi, et al.
Published: (2020-12-01) -
Odd Harmonious Labeling on Edge Amalgamation from Double Quadrilateral Graphs
by: Fery Firmansah, et al.
Published: (2020-01-01) -
Edge Even Graceful Labeling of Cylinder Grid Graph
by: Ahmed A. Elsonbaty, et al.
Published: (2019-04-01) -
Edge Even Graceful Labeling of Polar Grid Graphs
by: Salama Nagy Daoud
Published: (2019-01-01)