{
  "id": "1311.0858",
  "version": "v5",
  "published": "2013-11-02T08:55:11.000Z",
  "updated": "2014-07-02T15:02:46.000Z",
  "title": "Weak Integer Additive Set-Indexers of Certain Graph Products",
  "authors": [
    "N K Sudev",
    "K A Germina"
  ],
  "comment": "7 pages, arXiv admin note: text overlap with arXiv:1310.6091, arXiv:1311.0345, submitted",
  "categories": [
    "math.CO"
  ],
  "abstract": "An integer additive set-indexer is defined as an injective function $f:V(G)\\rightarrow 2^{\\mathbb{N}_0}$ such that the induced function $g_f:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. If $g_f(uv)=k \\forall uv\\in E(G)$, then $f$ is said to be a $k$-uniform integer additive set-indexers. An integer additive set-indexer $f$ is said to be a weak integer additive set-indexer if $|g_f(uv)|=max(|f(u)|,|f(v)|) \\forall uv\\in E(G)$. We have some characteristics of the graphs which admit weak integer additive set-indexers. We already have some results on the admissibility of weak integer additive set-indexer by certain graphs and finite graph operations. In this paper, we study further characteristics of certain graph products like cartesian product and corona of two weak IASI graphs and their admissibility of weak integer additive set-indexers and provide some useful results on these types of set-indexers.",
  "revisions": [
    {
      "version": "v5",
      "updated": "2014-07-02T15:02:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C78"
    ],
    "keywords": [
      "graph products",
      "admit weak integer additive set-indexers",
      "uniform integer additive set-indexers",
      "weak iasi graphs",
      "finite graph operations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1311.0858S"
    }
  }
}