Combining the Concepts of Residual and Domination in Graphs

Basit Öğe Kaydı
dc.authoridTURACI, TUFAN/0000-0002-6159-0935
dc.contributor.authorTuraci, Tufan
dc.contributor.authorAytac, Aysun
dc.date.accessioned2024-09-29T16:07:57Z
dc.date.available2024-09-29T16:07:57Z
dc.date.issued2019
dc.departmentKarabük Üniversitesien_US
dc.description.abstractLet 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 gamma(R)(uk)(G), 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 gamma(R)(G) = minv(k)is an element of V(G){gamma(R)(vk)(G)} . The average lower residual domination number of G is de- fined by gamma(R)(av)(G) = 1/vertical bar V(G)vertical bar Sigma(vk is an element of V(G)) gamma(R)(vk)(G). 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.en_US
dc.identifier.doi10.3233/FI-2019-1806
dc.identifier.endpage392en_US
dc.identifier.issn0169-2968
dc.identifier.issn1875-8681
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-85065025090en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage379en_US
dc.identifier.urihttps://doi.org/10.3233/FI-2019-1806
dc.identifier.urihttps://hdl.handle.net/20.500.14619/7282
dc.identifier.volume166en_US
dc.identifier.wosWOS:000466229800003en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIos Pressen_US
dc.relation.ispartofFundamenta Informaticaeen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNetwork Design and Communicationen_US
dc.subjectGraph vulnerabilityen_US
dc.subjectDomination numberen_US
dc.subjectResidual domination numberen_US
dc.subjectAverage lower residual domination numberen_US
dc.titleCombining the Concepts of Residual and Domination in Graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu