ON THE AVERAGE LOWER 2-DOMINATION NUMBER OF A GRAPH
| dc.authorid | TURACI, TUFAN/0000-0002-6159-0935 | |
| dc.contributor.author | Turaci, T. | |
| dc.date.accessioned | 2024-09-29T16:11:38Z | |
| dc.date.available | 2024-09-29T16:11:38Z | |
| dc.date.issued | 2019 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | Computer scientists and network scientists want a speedy, reliable, and nonstop communication. In a communication network, the vulnerability measures the resistance 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 relative 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 number of G, denoted as gamma(2av)(G), is a new measure of the network vulnerability, given by gamma(2av)(G) = 1/vertical bar V(G)vertical bar Sigma(v is an element of V) (G) gamma(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. | en_US |
| dc.identifier.endpage | 665 | en_US |
| dc.identifier.issn | 2146-1147 | |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.startpage | 658 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/8593 | |
| dc.identifier.volume | 9 | en_US |
| dc.identifier.wos | WOS:000473350600026 | en_US |
| dc.identifier.wosquality | N/A | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Turkic World Mathematical Soc | en_US |
| dc.relation.ispartof | Twms 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 | Graph vulnerability | en_US |
| dc.subject | Connectivity | en_US |
| dc.subject | Network design and communication | en_US |
| dc.subject | Domination number | en_US |
| dc.subject | Average lower 2-domination number | en_US |
| dc.title | ON THE AVERAGE LOWER 2-DOMINATION NUMBER OF A GRAPH | en_US |
| dc.type | Article | en_US |
