graph.lcf               package:igraph               R Documentation

_C_r_e_a_t_i_n_g _a _g_r_a_p_h _f_r_o_m _L_C_F _n_o_t_a_t_i_o_n

_D_e_s_c_r_i_p_t_i_o_n:

     LCF is short for Lederberg-Coxeter-Frucht, it is a concise
     notation for 3-regular Hamiltonian graphs. It constists of three
     parameters, the number of vertices in the graph, a list of shifts
     giving additional edges to a cycle backbone and another integer
     giving how many times the shifts should be performed. See <URL:
     http://mathworld.wolfram.com/LCFNotation.html> for details.

_U_s_a_g_e:

     graph.lcf(n, shifts, repeats)

_A_r_g_u_m_e_n_t_s:

       n: Integer, the number of vertices in the graph.

  shifts: Integer vector, the shifts.

 repeats: Integer constant, how many times to repeat the shifts.

_V_a_l_u_e:

     A graph object.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'graph' can create arbitrary graphs, see also the other functions
     on the its manual page for creating special graphs.

_E_x_a_m_p_l_e_s:

     # This is the Franklin graph:
     g1 <- graph.lcf(12, c(5,-5), 6)
     g2 <- graph.famous("Franklin")
     graph.isomorphic.vf2(g1, g2)

