Search Results for ""

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

The cube of a graph is defined as its third graph power.

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...