| Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|
|
|---|---|---|
| Page(s) | S1249 - S1259 | |
| DOI | https://doi.org/10.1051/ro/2020032 | |
| Published online | 02 March 2021 | |
Differential in infrastructure networks
Faculty of Science, Department of Computer Science, Dokuz Eylul University, Izmir 35160, Turkey
* Corresponding author: zeynep.berberler@deu.edu.tr
Received:
9
December
2019
Accepted:
18
March
2020
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 ∂(D) = |B(D)| − |D| and the maximum value of ∂(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 ∂-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.
Mathematics Subject Classification: 05C69
Key words: Differential / domination / graph invariant
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.