http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ON r-DYNAMIC COLORINGS OF THE FRIENDSHIP GRAPH FAMILIES
G. NANDINI,M. Venkatachalam,T. DEEPA,I. N. CANGUL 장전수학회 2021 Advanced Studies in Contemporary Mathematics Vol.31 No.2
Coloring of graphs is an important area in graph theory with numerous applications including the most famous problems related to graphs. An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, d(v)}, for each vertex v ∈ V (G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of Pn + Fn, Kn + Fn, L(Fn) and central graphs of the friendship graph.
On r-dynamic coloring of n-Sunlet graph families
G. Nandini,M. Venkatachalam,Vernold Vivin. J.,Dafik 장전수학회 2023 Proceedings of the Jangjeon mathematical society Vol.26 No.1
On r-dynamic coloring of n-Sunlet graph families