Information for "Dyck graph"

From HandWiki

Basic information

Display titleDyck graph
Default sort keyDyck graph
Page length (in bytes)3,969
Namespace ID0
Page ID273430
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Page imageDyck graph hamiltonian.svg
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Pchauhan2001
Date of page creation17:44, 6 February 2024
Latest editorimported>Pchauhan2001
Date of latest edit17:44, 6 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (37)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck. It is Hamiltonian with 120 distinct Hamiltonian cycles. It has chromatic number 2, chromatic index 3, radius 5, diameter 5 and girth 6. It is also a 3-vertex-connected...
Information from Extension:WikiSEO