On the average lower 2-domination number of a graph
| dc.contributor.author | Turaci, T. | |
| dc.date.accessioned | 2024-09-29T16:22:33Z | |
| dc.date.available | 2024-09-29T16:22:33Z | |
| dc.date.issued | 2019 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | Computer scientists and network scientists want a speedy, reliable, and non- stop communication. In a communication network, the vulnerability measures the re- sistance of the network to disruption of operation after the failure of certain stations or communication links. The average lower 2-domination number of a graph G rela- tive to a vertex v is the cardinality of a minimum 2-dominating set in G containing v. Consider the graph G modeling a network. The average lower 2-domination num- ber of G, denoted as ?2av(G), is a new measure of the network vulnerability, given by ?2av(G) = 1/|V(G)|?v?V(G) ?2v(G). In this paper, above mentioned new parameter is defined and examined, also the average lower 2-domination number of well known graph families are calculated. Then upper and lower bounds are determined and exact formulas are found for the average lower 2-domination number of any graph G. © Işik University, Department of Mathematics, 2019. | en_US |
| dc.identifier.endpage | 665 | en_US |
| dc.identifier.issn | 2146-1147 | |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.scopus | 2-s2.0-85074603886 | en_US |
| dc.identifier.scopusquality | Q4 | en_US |
| dc.identifier.startpage | 658 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/10140 | |
| dc.identifier.volume | 9 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Isik University | en_US |
| dc.relation.ispartof | Turkish World Mathematical Society Journal of Applied and Engineering Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Average lower 2-domination number | en_US |
| dc.subject | Connectivity | en_US |
| dc.subject | Dom- ination number | en_US |
| dc.subject | Graph vulnerability | en_US |
| dc.subject | Network design and communication | en_US |
| dc.title | On the average lower 2-domination number of a graph | en_US |
| dc.type | Article | en_US |
