Sign in
Two general results on harmonious labelings
Journal article

Two general results on harmonious labelings

Ars combinatoria, Vol.68(1), pp.225-230
01/07/2003

Abstract

Mathematics Physical Sciences Science & Technology
In this paper, we show that if G is a harmonious graph, then (2n +1)G (the disjoint union of 2n+1 copies of G) and G((2n+1)) (the graph consisting of 2n+1 copies of G with one fixed vertex in common) are harmonious for all n greater than or equal to 0.

Metrics

1 Record Views

Details