chromatic transversal roman domination in graphs
|
|
|
|
|
|
|
|
نویسنده
|
pushpam p. roushini leely
|
|
منبع
|
communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 1 - صفحه:51 -66
|
|
چکیده
|
For a graph g with chromatic number k, a dominating set s of g is called a chromatic-transversal dominating set (ctd-set) if s intersects every color class of any k-coloring of g.
|
|
کلیدواژه
|
domination ,coloring ,chromatic transversal roman domination
|
|
آدرس
|
d.b. jain college, department of mathematics, india
|
|
پست الکترونیکی
|
roushinip@yahoo.com
|
|
|
|
|
|
|