Skip to content
akaturk Academic measurement
Search

Article detail · 2017 · article

Robustness of regular caterpillars

YÖKSİS OpenAlex
Year2017
Citations24OpenAlex
Percentile%64.9
FWCI0.581.00 = world average
Scopus (SJR)Q2
WoS (JCR)Q4

Data source split

  • YÖKSİSYÖKSİS article record
  • YÖKSİS venueInternational Journal of Foundations of Computer Science
  • Catalog match (ISSN)International Journal of Foundations of Computer Science
  • OpenAlexOpenAlex enrichment (abstract, citations, topics)

Abstract

OpenAlex English

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.

Topics

Citations

OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.

24citationsOpenAlex · cited_by_count (cache / database)

12 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).

  1. 2019 Exponential Domination Critical and Stability in Some GraphsCitations 6 · OpenAlex
  2. 2019 Exponential Domination Critical and Stability in Some GraphsCitations 6 · OpenAlex
  3. 2019 Exponential Domination Critical and Stability in Some GraphsCitations 6 · OpenAlex
  4. 2024 Closeness of some tree structuresCitations 4 · OpenAlex
  5. 2022 VULNERABILITY OF BANANA TREES VIA CLOSENESS AND RESIDUAL CLOSENESS PARAMETERSCitations 4 · OpenAlex
  6. 2024 Node and Link Vulnerability in Complete Multipartite NetworksCitations 3 · OpenAlex
  7. 2024 Node and Link Vulnerability in Complete Multipartite NetworksCitations 3 · OpenAlex
  8. 2019 Global distribution center number of some graphs and an algorithmCitations 3 · OpenAlex
  9. 2019 Global distribution center number of some graphs and an algorithmCitations 3 · OpenAlex
  10. 2024 Determining Vulnerability of Central Networks Using Closeness and Nordhaus–Gaddum Type RelationCitations 0 · OpenAlex

Authors

2
  1. AYSUN AYTAÇ EGE ÜNİVERSİTESİ 1
  2. ZEYNEP NİHAN BERBERLER 2