Name
Abstract | ||
|---|---|---|
This article deals with generalized entropies for graphs. These entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements (e.g., vertices) of the graph. We introduce a new class of generalized measures, develop their properties, compute the measures for selected graphs, and briefly discuss potential applications to classification and clustering problems. © 2011 Wiley Periodicals, Inc. Complexity, 17,45–50, 2011 © 2011 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/cplx.20379 | Complexity |
Keywords | Field | DocType |
generalized measure,information measure,defining probability distribution,article deal,selected graph,generalized entropy,wiley periodicals,generalized graph entropy,entropies result,inc. complexity,clustering problem,entropy,information theory | Discrete mathematics,Combinatorics,Comparability graph,Graph property,Probability distribution,Null graph,Clique-width,Topological graph theory,Voltage graph,Mathematics,Graph (abstract data type) | Journal |
Volume | Issue | ISSN |
17 | 2 | 1076-2787 |
Citations | PageRank | References |
9 | 0.87 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Dehmer | 1 | 863 | 104.05 |
| Abbe Mowshowitz | 2 | 563 | 124.43 |