Search Results for ""

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

An algebra with no nontrivial ideals.

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

A simple function is a finite sum sum_(i)a_ichi_(A_i), where the functions chi_(A_i) are characteristic functions on a set A. Another description of a simple function is a ...

A polygon P is said to be simple (or a Jordan polygon) if the only points of the plane belonging to two polygon edges of P are the polygon vertices of P. Such a polygon has a ...