Differential in infrastructure networks

Creative Commons License

Kanli A., BERBERLER Z. N.

RAIRO-OPERATIONS RESEARCH, cilt.55, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 55
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1051/ro/2020032
  • Dergi Adı: RAIRO-OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Business Source Elite, Business Source Premier, Communication Abstracts, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Anahtar Kelimeler: Differential, domination, graph invariant
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighbor in the vertex set D. The differential of a vertex set D is defined as partial differential (D) = |B(D)| - |D| and the maximum value of partial differential (D) for any subset D of V is the differential of G. A set D of vertices of a graph G is said to be a dominating set if every vertex in V \ D is adjacent to a vertex in D. G is a dominant differential graph if it contains a partial differential -set which is also a dominating set. This paper is devoted to the computation of differential of wheel, cycle and path-related graphs as infrastructure networks. Furthermore, dominant differential wheel, cycle and path-related types of networks are recognized.