Name
Abstract | ||
|---|---|---|
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*} |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TNSM.2017.2774978 | IEEE Transactions on Network and Service Management |
Keywords | Field | DocType |
Entropy,Monitoring,Artificial neural networks,Boundary conditions,Informatics | Graph,Combinatorics,Vertex (geometry),Computer science,Computer network | Journal |
Volume | Issue | ISSN |
14 | 4 | 1932-4537 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philip Tee | 1 | 5 | 3.07 |
| George Parisis | 2 | 122 | 16.44 |
| Ian Wakeman | 3 | 436 | 129.40 |