Symmetric graphs with respect to graph entropy

zbMath1355.05114arXiv1510.01415MaRDI QIDQ510346

Seyed Saeed Changiz Rezaei, Ehsan Chiniforooshan

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.01415

zbMATH Keywords

fractional chromatic numbergraph entropy

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Information theoretic parameters of noncommutative graphs and convex corners

Cites Work

• Entropy splitting for antiblocking corners and perfect graphs
• Entropy of symmetric graphs
• New bounds for perfect hashing via information theory
• Perfect couples of graphs
• Capacities of graphs and \(2\)-matchings
• Graphs that Split Entropies
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fredman–Komlós bounds and information theory
• Two-step encoding for finite sources
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symmetric graphs with respect to graph entropy