No label defined (Q3737464)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3970798 |
Statements
1986
0 references
hypercube
0 references
0.879838228225708
0 references
0.8378294110298157
0 references
0.82088303565979
0 references
0.8188036680221558
0 references
0.7999184131622314
0 references
[For the entire collection see Zbl 0582.00008.] The authors discuss various graph theoretical characterizations of hypercubes. Using a theorem of S. Föld they prove that a finite graph G is a hypercube if and only if it is connected, bipartite and the number of geodetics of \(G\times K_ 2\) depends only on their distance. Several related questions are also discussed.
0 references