Correction to "Vertex Entropy as a Critical Node Measure in Network Monitoring"
From Definition 2 in the above-named work, we have for a simple graph G=(V,E) , the following expression for the chromatic entropy I_{C}(G) of a graph: \begin{equation*} I_{C}\left ({G}\right) = \min _{\left \{{C_{i}}\right \}} - \sum _{i=1}^{N_{c}} \frac {|C_{i}|}{n} \log _{2} \frac {|C_{i}|}{n}...
Gespeichert in:
Veröffentlicht in: | IEEE eTransactions on network and service management 2017-12, Vol.14 (4), p.1185-1185 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | From Definition 2 in the above-named work, we have for a simple graph G=(V,E) , the following expression for the chromatic entropy I_{C}(G) of a graph: \begin{equation*} I_{C}\left ({G}\right) = \min _{\left \{{C_{i}}\right \}} - \sum _{i=1}^{N_{c}} \frac {|C_{i}|}{n} \log _{2} \frac {|C_{i}|}{n} \tag{1}\end{equation*} |
---|---|
ISSN: | 1932-4537 1932-4537 |
DOI: | 10.1109/TNSM.2017.2774978 |