\(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (Q2089930)
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 7606134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected |
scientific article; zbMATH DE number 7606134 |
Statements
\(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (English)
0 references
24 October 2022
0 references
\(L(n)\) graph
0 references
path
0 references
cycle
0 references
vertex-pancyclic graph
0 references
Hamilton-connected graph
0 references
0.8372429609298706
0 references
0.8366513848304749
0 references
0.8103758096694946
0 references
