The complexity of finite graphs (Q1363999)
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: The complexity of finite graphs |
scientific article; zbMATH DE number 1050703
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finite graphs |
scientific article; zbMATH DE number 1050703 |
Statements
The complexity of finite graphs (English)
0 references
20 August 1997
0 references
This work concerns the complexity of finite undirected graphs, including bipartite graphs, generated by circuits of functional elements. The graphs under consideration have neither loops nor multiple edges and the vertices of these graphs are numbered.
0 references
Boolean functions
0 references
Shannon functions
0 references
generating graphs
0 references
integer sequence
0 references
complexity
0 references
circuits
0 references
0 references
0.9340203
0 references
0 references
0 references
0.9301896
0 references
