The average-dominating of a graph

Basit Öğe Kaydı
dc.contributor.authorDündar P.
dc.contributor.authorKiliç E.
dc.contributor.authorBalci M.A.
dc.date.accessioned2019-10-26T22:53:00Z
dc.date.available2019-10-26T22:53:00Z
dc.date.issued2009
dc.departmentEge Üniversitesien_US
dc.description5th International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, ICSCCW 2009 -- 2 September 2009 through 4 September 2009 -- Famagusta -- 79736en_US
dc.description.abstractThe vulnerability is one of the most important concepts in network design. Vulnerability can be considered as the resistance of the network after any breakdown in its nodes or links. Since any network can be modelled by a graph, vulnerability parameters on graphs also work on network types. The vertices and the edges of a graph correspond to the processors and the links of the network, respectively. The measure parameters about the vulnerability of a connected graph which are mostly used and known are based on the Neighbourhood concept. Neighbour-integrity, edge-integrity and accessibility number are some of these parameters. In this work we defined and examined the Average-Dominating of a connected graph as a new global connectivity measure. It takes account the neighbourhoods of all pairs of vertices. First we define the pair dominating of any two vertices such as u and v in a graph as to be the maximum number of vertices which dominate both u and v in G. It is denoted by D(u,v). Then latter we define the average dominating of G denoted by D¯(G) as, (Equation Presented) , where G is a graph of order n. ©2009 IEEE.en_US
dc.identifier.doi10.1109/ICSCCW.2009.5379419
dc.identifier.isbn9781424434282
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1109/ICSCCW.2009.5379419
dc.identifier.urihttps://hdl.handle.net/11454/20332
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofICSCCW 2009 - 5th International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Controlen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleThe average-dominating of a graphen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu