Search Results for ""

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...