Search Results for ""

A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

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

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

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

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

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.

A cycle graph of a group is a graph which shows cycles of a group as well as the connectivity between the cycles. Such graphs are constructed by drawing labeled nodes, one ...