Indonesian Journal of Combinatorics
Vol 3, No 1 (2019)

The oriented chromatic number of edge-amalgamation of cycle graph

Dina Eka Nurvazly (Universitas Indonesia)
Jona Martinus Manulang (Universitas Indonesia)
Kiki A. Sugeng (Universitas Indonesia)

Article Info

Publish Date
30 Jun 2019

Abstract

An oriented k − coloring of an oriented graph G⃗ is a partition of V(G⃗) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction. The oriented chromatic number of an oriented graph G⃗ is the minimum order of an oriented graph H⃗ to which G⃗ admits a homomorphism to H⃗. The oriented chromatic number of an undirected graph G is the maximum oriented chromatic number of all possible orientations of the graph G. In this paper, we show that every edge amalgamation of cycle graphs, which also known as a book graph, has oriented chromatic number less than or equal to six.

Copyrights © 2019




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
332.422 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Indonesian Journal of Combinatorics
Website

Abbrev

ijc

Publisher

Indonesian Combinatorial Society

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian ...