On the harmonious coloring of collections of graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 1995 English Publisher:WileyJournal:Journal of Graph Theory, volume 20, pages 241-254 (issn: 0364-9024, eissn: 1097-0118,

Copyright policy )

Authors: John P. Georges;

doi: 10.1002/jgt.3190200213

On the harmonious coloring of collections of graphs

- Summary
- Subjects
- Metrics

Abstract

AbstractThe hermonious coloring number of the graph G, HC(G), is the smallest number of colors needed to label the vertices of G such that adjacent vertices received different colors and no two edges are incident with the same color pair. In this paper, we investigate the HC‐number of collections of disjoint paths, cycles, complete graphs, and complete bipartite graphs. We determine exact expressions for the HC‐number of collections of paths and 4m‐cycles. © 1995, John Wiley & Sons, Inc.

Related Organizations

Trinity Baptist College
United States

Keywords

HC-number, Coloring of graphs and hypergraphs, harmonious coloring number, Paths and cycles, colors

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average