|
|
|
|
domination parameters of the splitting graph of a graph
|
|
|
|
|
|
|
|
نویسنده
|
deepalakshmi j. ,marimuthu g. ,somasundaram arumugam ,arumugam subramanian
|
|
منبع
|
communications in combinatorics and optimization - 2023 - دوره : 8 - شماره : 4 - صفحه:631 -637
|
|
چکیده
|
Let g = (v, e) be a graph of order n and size m. the graph sp(g) obtained from g by adding a new vertex v´ for every vertex v ∈ v and joining v´ to all neighbors of v in g is called the splitting graph of g. in this paper, we determine the domination number, the total domination number, connected domination number, paired domination number and independent domination number for the splitting graph sp(g).
|
|
کلیدواژه
|
splitting graph ,domination ,total domination ,connected domination ,paired domination ,independent domination
|
|
آدرس
|
madurai kamaraj university, department of mathematics, india, madura college, department of mathematics, india, dubai international academic city, birla institute of technology & science, pilani, dubai campus, department of mathematics, united arab emirates, kalasalingam academy of research and education, national centre for advanced research in discrete mathematics, india
|
|
پست الکترونیکی
|
s.arumugam.klu@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|