ขอบเขตของจำนวนโดมิเนชันของกราฟการรวมจุดยอดของวง

Abstract

A subset D of vertices in a graph G is a dominating set if every vertex in V\left(G\right)-D is adjacent to some vertex in D. The domination number of a graph G is defined to be the minimum cardinality among all dominating sets of G and is denoted by \gamma(G). In this independent study, we determine upper and lower bounds of the domination numbers of vertex–amalgamations of cycles.