http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
$delta^(k)$-colouring of cycle related graphs
Johan Kok,N.K. Sudev 장전수학회 2022 Advanced Studies in Contemporary Mathematics Vol.32 No.1
With respect to a proper colouring of a graph G, we know that 2≤χ(G)≤∆(G)+1. If distinct colours represent distinct technology types to be located at vertices, the question arises on how to place at least one of each of k, 1≤k<χ(G), technology types together with the minimum adjacency between similar technology types. In an improper colouring, an edge uv such that c(u) = c(v) is called a bad edge. In this paper, we introduce the notion of δ(k)-colouring which is a near proper colouring of G with exactly 1≤k < χ(G) distinct colours which minimizes the number of bad edges.