Bilangan Kromatik Titik dari Dual Graf Berlian

A vertex coloring of a graph , is an assigments colors to the vertices such that no two adjacent are assigned same color. The least number needed for chromatic number, denoted by . said be planar if it can drawn in plane so edges crossing except at endpoints. dual constructed from graph. Each region represented Two connected these neugbours and have common border. diamond used model structure networks. In this study, shown χ(〖Br_n〗^* )={█(3,n=2 n≥4@4,n=3.)┤