Mean rupture degree of graphs

Simple item page
dc.contributor.authorAslan E.
dc.contributor.authorBacak-Turan G.
dc.date.accessioned2024-07-22T08:12:18Z
dc.date.available2024-07-22T08:12:18Z
dc.date.issued2016
dc.description.abstractThe vulnerability shows the resistance of the network until communication breakdown after the disruption of certain stations or communication links. We introduce a new graph parameter, the mean rupture degree. Let G be a graph of order p and S be a subset of V(G). The graph G-S contains at least two components and if each one of the components of G-S have orders p1, p2,pk, then m(G-S)=Σtk=pi2/Σtk=pt Formally, the mean rupture degree of a graph G, denoted mr(G), is defined as mr(G)=max-ω(G-S)-|S|- (G-S): SV(G), ω(G-S)1} where ω(G-S) denote the number of components. In this paper, the mean rupture degree of some classes of graphs are obtained and the relations between mean rupture degree and other parameters are determined.
dc.identifier.issn12237027
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/15977
dc.language.isoEnglish
dc.publisherPolitechnica University of Bucharest
dc.subjectNetwork security
dc.subjectCommunication breakdowns
dc.subjectConnectivity
dc.subjectGraph parameters
dc.subjectIntegrity
dc.subjectMean integrity
dc.subjectNumber of components
dc.subjectRupture degree
dc.subjectTwo-component
dc.subjectGraph theory
dc.titleMean rupture degree of graphs
dc.typeArticle

Files

Collections

Scopus Koleksiyonu