Strong chromatic index of certain nanosheets
|
|
|
|
|
|
|
|
نویسنده
|
ganesan vidya ,rajasingh indra
|
|
منبع
|
journal of discrete mathematics and its applications - 2022 - دوره : 7 - شماره : 1 - صفحه:29 -38
|
|
چکیده
|
Strong edge-coloring of a graph is a proper edge coloring such that every edge of a path of length 3 uses three different colors. the strong chromatic index of a graph is the minimum number k such that there is a strong edge-coloring using k colors and is denoted by χ′ s(g). we give efficient algorithms for strong edge-coloring of certain nanosheets using optimum number of colors.
|
|
کلیدواژه
|
strong edge-coloring ,strong chromatic index ,nanosheets
|
|
آدرس
|
vit university, school of advanced sciences, India, vit university, school of advanced sciences, India
|
|
|
|
|
|
|
|
|
|