On the domination number of the generalized Petersen graphs

A. Behzad, M. Behzad, Cheryl Praeger

    Research output: Contribution to journalArticle

    23 Citations (Scopus)

    Abstract

    Graph domination numbers and algorithms for finding them have been investigated for numerous classes of graphs, usually for graphs that have some kind of tree-like structure. By contrast, we study an infinite family of regular graphs, the generalized Petersen graphs G(n). We give two procedures that between them produce both upper and lower bounds for the (ordinary) domination number of G(n), and we conjecture that our upper bound left ceiling3n/5right ceiling is the exact domination number. To our knowledge this is one of the first classes of regular graphs for which such a procedure has been used to estimate the domination number.
    Original languageEnglish
    Pages (from-to)603-610
    JournalDiscrete Mathematics
    Volume308
    Issue number4
    DOIs
    Publication statusPublished - 2008

    Fingerprint Dive into the research topics of 'On the domination number of the generalized Petersen graphs'. Together they form a unique fingerprint.

    Cite this