On the centrality of some graphs
| Autor: | Vecdi Aytaç |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Network vulnerability
Computer science Closeness 0102 computer and information sciences Network theory 01 natural sciences Betweenness centrality Katz centrality gear graph 0101 mathematics Discrete mathematics lcsh:T57-57.97 lcsh:Mathematics 010102 general mathematics helm graph Complex network betweenness centrality of a graph lcsh:QA1-939 Random walk closeness centrality Vertex (geometry) sunflower graph and friendship graph Network vulnerability Network design and communication Stability Betweenness centrality of a graph Gear graph Helm graph 010201 computation theory & mathematics lcsh:Applied mathematics. Quantitative methods Centrality Stability MathematicsofComputing_DISCRETEMATHEMATICS network design and communication |
| Zdroj: | New Trends in Mathematical Sciences, Vol 5, Iss 4, Pp 1-11 (2017) Volume: 5, Issue: 4 1-11 New Trends in Mathematical Sciences |
| ISSN: | 2147-5520 |
| Popis: | A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|