Incidence Coloring of Product Graphs of Paths
- Resource Type
- Conference
- Authors
- Peng, Lizhen; Tian, Shuangliang; Lu, Qiqi
- Source
- 2021 International Conference on Big Data Analysis and Computer Science (BDACS) BDACS Big Data Analysis and Computer Science (BDACS), 2021 International Conference on. :157-161 Jun, 2021
- Subject
- Computing and Processing
Computer science
Image color analysis
Big Data
direct product
semi-strong product
strong product
incidence coloring
incidence coloring number
- Language
Incidence coloring of graph refers to coloring of its all incidences in which neighborly incidences are assigned different colors. The smallest number of colors in an incidence coloring is incidence coloring number of graph. In this paper, structural coloring method and disproof method are used. we study the incidence coloring of direct products, semi-strong products and strong products of paths of different orders, and obtain the exact values of the incidence coloring numbers. The incidence coloring number of the direct product and the strong product of a path is the maximunm degree plus one.