{
  "id": "1310.5779",
  "version": "v5",
  "published": "2013-10-22T02:13:47.000Z",
  "updated": "2014-03-01T18:42:36.000Z",
  "title": "A Characterisation of Weak Integer Additive Set-Indexers of Graphs",
  "authors": [
    "N K Sudev",
    "K A Germina"
  ],
  "comment": "12pages, 4 figures, arXiv admin note: text overlap with arXiv:1311.0858",
  "journal": "ISPACS Journal of Fuzzy Set Valued Analysis, Article Id: jfsva-00189, 2014, 7pages",
  "doi": "10.5899/2014/jfsva-00189",
  "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. An integer additive set-indexer is said to be $k$-uniform if $|g_f(e)| = k$ for all $e\\in E(G)$. 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)|)$ for all $u,v\\in V(G)$. In this paper, we study the characteristics of certain graphs and graph classes which admit weak integer additive set-indexers.",
  "revisions": [
    {
      "version": "v5",
      "updated": "2014-03-01T18:42:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C78"
    ],
    "keywords": [
      "characterisation",
      "admit weak integer additive set-indexers",
      "graph classes",
      "injective function",
      "induced function"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1310.5779S"
    }
  }
}