Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorAytaç, Aysunen_US
dc.contributor.authorAtay Atakul, Betülen_US
dc.date.accessioned2020-10-23T07:44:13Z
dc.date.available2020-10-23T07:44:13Z
dc.date.issued2019
dc.identifier.citationAytaç, A. & Atay Atakul, B. (2019). Exponential domination of tree related graphs. TWMS Journal of Applied and Engineering Mathematics, 9(2), 186-197.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2707
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/398
dc.description.abstractThe well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate neighbourhood, in some real World situations, this can be change. The vertex can also influence all vertices within a given distance. This situation is characterized by distance domination. The influence of the vertex in the graph doesn’t extend beyond its neighbourhood and even this influence decreases with distance. Up to the present, no framework for this situation has been put forward yet. The dominating power of the vertex in the graph decreases exponentially, with distance by the factor 1/2. Hence a vertex v can be dominated by a neighbour of v or by a number of vertices that are not too far from v. In this paper, we study the vulnerability of interconnection networks to the influence of individual vertices, using a graph-theoretic concept of exponential domination number as a measure of network robustness.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal of Applied and Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectGraph vulnerabilityen_US
dc.subjectNetwork design and communicationen_US
dc.subjectDominationen_US
dc.subjectExponential domination numberen_US
dc.subjectTreesen_US
dc.subjectRupture degreeen_US
dc.titleExponential domination of tree related graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume9
dc.identifier.issue2
dc.identifier.startpage186
dc.identifier.endpage197
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess