Search Results for ""

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

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). ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...