In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previo...

Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previous NP-completeness results of the harmonious coloring problem on subclasses of chordal and co-chordal graphs, we prove that...

A harmonious coloring of G is a proper vertex coloring of G such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of G, h(G), is the minimum number of colors needed for a harmonious coloring of G. We show that if T is a forest of order n with maximum degree ∆(T ) ≥ n+2 3 , then h(T ) = { ∆(T ) + 2, if T has non-adjacent vertices of degr...

The dualistic model of passion was investigated in a work context. This model states that individuals may develop either a harmonious or obsessive passion for a valued activity. We hypothesized that harmonious passion for work would be positively related to job satisfaction through higher perceptions of belongingness at work. Results from a survey conducted with 278 Norwegian employees showed t...

In this paper, we have shown that collection of paths P i n where n is odd, cycle, triangular snake, quadrilateral snake, P 2 n are even sequential harmonious graph and also we prove that the cycle Cn be a cycle u1, u2, · · · , un is an even sequential harmonious graph. Let G be a graph with V (G) = V (Cn) ∪ {wi : 1 ≤ i ≤ n}, E(G) = E(Cn) ∪ {uiwiui−1wi : 1 ≤ i ≤ n}, then G is an even sequential...