Optimal graphs for independence and \(k\)-independence polynomials (Q1756111): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129293306, #quickstatements; #temporary_batch_1726270017965 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963598847 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1710.03249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proofs from THE BOOK / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Least reliable networks and the reliability domination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of uniformly optimally reliable networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2843434 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonexistence of optimal graphs for all terminal reliability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independence polynomials of circulants with an application to music / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniformly optimally reliable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Componentwise linear ideals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3043192 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5726070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4106232 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lexifying ideals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniformly-most reliable networks do not always exist / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with least number of colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal graphs for chromatic polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Upper Bound Conjecture and Cohen-Macaulay Rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dependence polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplicial complexes of graphs / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129293306 / rank | |||
Normal rank |
Latest revision as of 01:29, 14 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal graphs for independence and \(k\)-independence polynomials |
scientific article |
Statements
Optimal graphs for independence and \(k\)-independence polynomials (English)
0 references
11 January 2019
0 references
independence polynomial
0 references
optimal graph
0 references
\(k\)-clique-free graph
0 references