Entropy of symmetric graphs (Q898092): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Chris D. Godsil / rank | |||
Property / author | |||
Property / author: Chris D. Godsil / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1881477017 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1311.6561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4821526 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Entropy of symmetric graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain polytopes associated with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Capacities of graphs and \(2\)-matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4053473 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fredman–Komlós bounds and information theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-step encoding for finite sources / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs that Split Entropies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New bounds for perfect hashing via information theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect couples of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2758342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4840778 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5311854 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:51, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Entropy of symmetric graphs |
scientific article |
Statements
Entropy of symmetric graphs (English)
0 references
8 December 2015
0 references
graph entropy
0 references
fractional chromatic number
0 references
vertex packing polytope
0 references
perfect graphs
0 references