Search Results for ""

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

A graph cycle.

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

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

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...