Search Results for ""

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 traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

Percolation theory deals with fluid flow (or any other similar process) in random media. If the medium is a set of regular lattice points, then there are two main types of ...