On vulnerability of the hexagonal cactus chains
| dc.contributor.author | Turacı, Tufan | |
| dc.date.accessioned | 2024-09-29T16:33:24Z | |
| dc.date.available | 2024-09-29T16:33:24Z | |
| dc.date.issued | 2018 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | Let G = (V(G), E(G) be a simple molecular graph without directed and multiple edges and without loops. The vulnerability value of agraph shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown.The domination number and its variations are the most important vulnerability parameters for graphs. One of them is the averagelower domination number. It is denoted by ?av(G), also is defined as: GV G1cav ^ =^hh ?v?V(G) ?v(G), where the lower dominationnumber, denoted by ?v(G), is the minimum cardinality of a dominating set of the graph G that contains the vertex v (Henning 2004).In this paper, the average lower domination number of different hexagonal cactus chains are determined. | en_US |
| dc.identifier.endpage | 88 | en_US |
| dc.identifier.issn | 2146-4987 | |
| dc.identifier.issue | 1 | en_US |
| dc.identifier.startpage | 84 | en_US |
| dc.identifier.trdizinid | 320463 | en_US |
| dc.identifier.uri | https://search.trdizin.gov.tr/tr/yayin/detay/320463 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/11825 | |
| dc.identifier.volume | 8 | en_US |
| dc.indekslendigikaynak | TR-Dizin | en_US |
| dc.institutionauthor | Turacı, Tufan | |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Karaelmas Fen ve Mühendislik Dergisi | en_US |
| dc.relation.publicationcategory | Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.title | On vulnerability of the hexagonal cactus chains | en_US |
| dc.type | Article | en_US |
