Search Results for ""

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

An exmedian is a parallel to a side of a triangle through the opposite vertex. So in the above diagram, A_2^'A_3^' is the exmedian of side A_2A_3, and so on. The pairwise ...

A ruled surface is called a generalized cone if it can be parameterized by x(u,v)=p+vy(u), where p is a fixed point which can be regarded as the vertex of the cone. A ...

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

Given a point P in the interior of a triangle DeltaA_1A_2A_3, draw the cevians through P from each polygon vertex which meet the opposite sides at P_1, P_2, and P_3. Now, ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...