Makale detayı · 2017 · article
Robustness of Regular Caterpillars
Veri kaynağı ayrımı
- YÖKSİSYÖKSİS makale kaydı
- YÖKSİS dergi adıInternational Journal of Foundations of Computer Science
- Katalog eşleşmesi (ISSN)International Journal of Foundations of Computer Science
- OpenAlexOpenAlex zenginleştirmesi (özet, atıf, konular)
- Semantic Scholaratıf sayısı (OpenAlex ile birleştirilmez)
Özet
Robustness of the network topology is a key aspect in the design of computer networks. Vertex residual closeness is a new graph-theoretic concept defined as a measure of network robustness. In this model, edges are perfectly reliable and the vertices fail independently of each other. In this paper, vertex residual closeness of paths and regular caterpillars are calculated by giving an insight of how to evaluate the vertex residual closeness of path-like graphs.
Konular
Atıflar
OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.
25atıfOpenAlex · cited_by_count (önbellek / veritabanı)
Yerel katalogda bu makaleye atıf yapan 12 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).
- 2019 Exponential Domination Critical and Stability in Some GraphsAtıf 6 · OpenAlex
- 2019 Exponential Domination Critical and Stability in Some GraphsAtıf 6 · OpenAlex
- 2019 Exponential Domination Critical and Stability in Some GraphsAtıf 6 · OpenAlex
- 2024 Closeness of some tree structuresAtıf 4 · OpenAlex
- 2022 VULNERABILITY OF BANANA TREES VIA CLOSENESS AND RESIDUAL CLOSENESS PARAMETERSAtıf 4 · OpenAlex
- 2024 Node and Link Vulnerability in Complete Multipartite NetworksAtıf 3 · OpenAlex
- 2024 Node and Link Vulnerability in Complete Multipartite NetworksAtıf 3 · OpenAlex
- 2019 Global distribution center number of some graphs and an algorithmAtıf 3 · OpenAlex
- 2019 Global distribution center number of some graphs and an algorithmAtıf 3 · OpenAlex
- 2024 Determining Vulnerability of Central Networks Using Closeness and Nordhaus–Gaddum Type RelationAtıf 0 · OpenAlex