Combining the Concepts of Residual and Domination in Graphs
Makaleler > Tam Makale · 2019
Yazarlar: Tufan Turacı, Aysun AYTAÇ
Fundamenta Informaticae, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2019, cilt 166, ss 379-392
DOI: 10.3233/fi-2019-1806
Özet
Let G = ( V ( G), E( G)) be a simple undirected graph. The domination and average lower domination numbers are vulnerability parameters of a graph. We have investigated a refinement that involves the residual domination and average lower residual domination numbers of these parameters. The lower residual domination number, denoted by [Formula: see text], is the minimum cardinality of dominating set in G that received from the graph G where the vertex v k and all links of the vertex v k are deleted. The residual domination number of graphs G is defined as [Formula: see text]. The average lower residual domination number of G is defined by [Formula: see text]. In this paper, we define the residual domination and the average lower residual domination numbers of a graph and we present the exact values, upper and lower bounds for some graph families.