Ara
Toplam kayıt 3, listelenen: 1-3
Domination integrity of total graphs
(Işık University Press, 2014)
The domination integrity of a simple connected graph G is a measure of vulnerability of a graph. Here we determine the domination integrity of total graphs of path Pn, cycle Cn and star K1,n.
Graphs with equal domination and independent domination number
(Işık University Press, 2015)
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the ...
Some results on total chromatic number of a graph
(Işık University Press, 2017-08-24)
A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph is the smallest positive integer for which the graph admits ...