{
  "id": "math/0509259",
  "version": "v1",
  "published": "2005-09-12T14:55:27.000Z",
  "updated": "2005-09-12T14:55:27.000Z",
  "title": "Sierpi\\' nski Gasket Graphs and Some of Their Properties",
  "authors": [
    "Alberto M. Teguia",
    "Anant P. Godbole"
  ],
  "comment": "14 pages, 2 Figures",
  "journal": "Australasian Journal of Combinatorics, 35, 181--192, 2006",
  "categories": [
    "math.CO"
  ],
  "abstract": "The {\\it Sierpi\\'nski fractal} or {\\it Sierpi\\'nski gasket} $\\Sigma$ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph $S_n$ derived from the first $n$ iterations of the process that leads to $\\Sigma$, and study some of its properties, including its cycle structure, domination number and pebbling number. Various open questions are posed.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-09-12T14:55:27.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C99"
    ],
    "keywords": [
      "nski gasket graphs",
      "properties",
      "open questions",
      "familiar object",
      "sierpinski fractal"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......9259T"
    }
  }
}