Search Results for ""

The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

The fish graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["FishGraph"].

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

A graph for which every node has finite degree.

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...