A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2 (Q2859609)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2 |
scientific article; zbMATH DE number 6230061
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2 |
scientific article; zbMATH DE number 6230061 |
Statements
19 November 2013
0 references
adjoint polynomial
0 references
chromatic polynomial
0 references
adjoint equivalence
0 references
chromatic equivalence
0 references
A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2 (English)
0 references
