Abstract | ||
---|---|---|
Several connections between perfect graphs and the information theoretic functional graph entropy has been found in the last ten-fifteen years. A new development is that a newly introduced measure of graph imperfection, the imperfection ratio can also be characterized in terms of graph entropy. The talk is intended to present this result together with an overview of the earlier known ones. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1016/S1571-0653(05)80185-4 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Perfect graphs,imperfection ratio,graph entropy | Discrete mathematics,Combinatorics,Line graph,Graph property,Cubic graph,Distance-hereditary graph,Null graph,Butterfly graph,Mathematics,Perfect graph theorem,Voltage graph | Journal |
Volume | ISSN | Citations |
5 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 3 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gábor Simonyi | 1 | 249 | 29.78 |