http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
On the defining number and strong defining number for vertex colourings of Jahangir graphs
Z. Tahmasbzadehbaee,N.D. Soner 장전수학회 2012 Advanced Studies in Contemporary Mathematics Vol.22 No.3
In a given graph G = (V,E), a set S of vertices with an assignment of colours to them is called a defining set for vertex colourings of G, if there exists a unique extension of the colours of S to a k ≥ χ(G) colouring of the vertices of G. A defining set with minimum cardinality is called a minimum defining set and its cardinality is the defining number, denoted by d(G, k). In this article,we study the chromatic number, the defining number and the strong defining number of the Jahangir graphs Jm,n.