Injective coloring of some graph operations

Jiamei Song and Jun Yue

Applied Mathematics and Computation, 2015, vol. 264, issue C, 279-283

Abstract: An injective coloring of a graph G is a vertex coloring such that any two vertices with a common vertex receive distinct colors. The injective chromatic number χi(G) of a graph G is the least k such that there is an injective k-coloring. Graph operations are important methods for constructing new graphs, and they play key roles in the design and analysis of networks. In this study, we give some sharp bounds (or exact values) of graph operations, including the Cartesian product, direct product, lexicographic product, union, join, and disjunction of graphs.

Keywords: Cartesian product; Direct product; Graph operation; Injective chromatic operation; Lexicographic product (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315004439
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:264:y:2015:i:c:p:279-283

DOI: 10.1016/j.amc.2015.03.124

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().