Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"generalized Petersen graphs"”.

  1. Hamilton Paths in Generalized Petersen Graphs

    … for <i>n</i> > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is Hamilton-connected otherwise. We take the first step in the proof of this conjecture by proving the case <i>n</i> = 3<i>k</i> + …

    waterloo Repository record for Hamilton Paths in Generalized Petersen Graphs (opens in a new tab)

  2. Bipartite Density of Generalized Petersen Graphs

    … the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, k), where n ≥ 3 and 1 ≤ k < n with n ≠ 2k. The Generalized Petersen Graph P(n, k) has vertices [special characters omitted] and edges [special characters omitted] where subscript addition …

    mississippi Repository record for Bipartite Density of Generalized Petersen Graphs (opens in a new tab)

  3. INDEPENDENCE NUMBER OF SPECIFIED I-GRAPHS

    … the independence number of various classes of I-graphs. I-graphs are generalizations of the Generalized Petersen Graphs. We provide constructions of independent sets given any parameters, as well as bounds for some subclasses of I-graphs. We also prove exact results for some specific I-graphs.

    nps Repository record for INDEPENDENCE NUMBER OF SPECIFIED I-GRAPHS (opens in a new tab)

  4. STRUCTURAL PROPERTIES OF I-GRAPHS: THEIR INDEPENDENCE NUMBERS AND CAYLEY GRAPHS

    … numbers and algebraic properties of I-graphs. The I-graphs are a further generalization of the Generalized Petersen graphs whose independence numbers have been previously researched. Specifically, we give bounds for the independence number of different I-graphs and sub-classes of …

    nps Repository record for STRUCTURAL PROPERTIES OF I-GRAPHS: THEIR INDEPENDENCE NUMBERS AND CAYLEY GRAPHS (opens in a new tab)

  5. Groups, Graphs, and Symmetry-Breaking

    … is the set of distinguishing numbers of graphs G in which Aut(G) = Gamma. It is shown that D(Gamma) is non-empty for any finite group Gamma. In particular, D(D<sub>n</sub>) is found where D<sub>n</sub> is the dihedral group with 2n elements. From there, the generalized Petersen graphs, …

    vt Repository record for Groups, Graphs, and Symmetry-Breaking (opens in a new tab)

  6. On the Power Domination Problem in Graphs

    … power domination number of certain families of graphs, such as rectangular grids [5] have been found.

    texas-state Repository record for On the Power Domination Problem in Graphs (opens in a new tab)