Cite this DOI

V.S, R., & A, V. (2020). Super Cube Root Cube Mean Labeling of Graphs. *Journal of Science & Technology*, *05*(01), 17–24. https://doi.org/10.46243/jstj.2020.v5.i1.232

@article{vs2020super,
  author    = {V.S, Radhika and A, Vijayan},
  title     = {{Super Cube Root Cube Mean Labeling of Graphs}},
  journal   = {Journal of Science \& Technology},
  year      = {2020},
  month     = {jan},
  volume    = {05},
  number    = {01},
  pages     = {17--24},
  publisher = {Longman Publishers},
  issn      = {2456-5660},
  doi       = {10.46243/jstj.2020.v5.i1.232},
  url       = {https://doi.org/10.46243/jstj.2020.v5.i1.232},
  language  = {en},
  abstract  = {: A function f is called super cube root cube mean labeling of a graph G = (V,E) with p- vertices and q- edges if f: V(G) →\{ 1, 2, . . ., p + q\} is injective and the induced function f * defined as f * (uv) = 3 3 3 f(u) + f(v) 2       or 3 3 3 f(u) + f(v) 2       . For all uvE(G) is bijective. Then the resulting edge labels are distinct. A graph that admits a super cube root cube mean labeling f is called a super cube root cube means graph. In this paper we introduce super cube root cube mean labeling and investigate super cube root cube mean labeling of path Pn, Comb graph, ladder graph, pendant vertex attached with comb graph, pendant vertex attached with the ladder graph, CnK1, PnK3 and Fish graph.}
}

TY  - JOUR
TI  - Super Cube Root Cube Mean Labeling of Graphs
AU  - V.S, Radhika
AU  - A, Vijayan
JO  - Journal of Science & Technology
PY  - 2020
DA  - 2020/01/03/
VL  - 05
IS  - 01
SP  - 17
EP  - 24
PB  - Longman Publishers
SN  - 2456-5660
LA  - en
AB  - : A function f is called super cube root cube mean labeling of a graph G = (V,E) with p- vertices and q- edges if f: V(G) →{ 1, 2, . . ., p + q} is injective and the induced function f * defined as f * (uv) = 3 3 3 f(u) + f(v) 2       or 3 3 3 f(u) + f(v) 2       . For all uvE(G) is bijective. Then the resulting edge labels are distinct. A graph that admits a super cube root cube mean labeling f is called a super cube root cube means graph. In this paper we introduce super cube root cube mean labeling and investigate super cube root cube mean labeling of path Pn, Comb graph, ladder graph, pendant vertex attached with comb graph, pendant vertex attached with the ladder graph, CnK1, PnK3 and Fish graph.
DO  - 10.46243/jstj.2020.v5.i1.232
UR  - https://doi.org/10.46243/jstj.2020.v5.i1.232
ER  -

{
    "type": "article-journal",
    "id": "10.46243/jstj.2020.v5.i1.232",
    "DOI": "10.46243/jstj.2020.v5.i1.232",
    "URL": "https://doi.org/10.46243/jstj.2020.v5.i1.232",
    "title": "Super Cube Root Cube Mean Labeling of Graphs",
    "source": "Smart Scholars DOI Registry",
    "container-title": "Journal of Science & Technology",
    "author": [
        {
            "family": "V.S",
            "given": "Radhika"
        },
        {
            "family": "A",
            "given": "Vijayan"
        }
    ],
    "issued": {
        "date-parts": [
            [
                2020,
                1,
                3
            ]
        ]
    },
    "volume": "05",
    "issue": "01",
    "page": "17-24",
    "publisher": "Longman Publishers",
    "language": "en",
    "abstract": ": A function f is called super cube root cube mean labeling of a graph G = (V,E) with p- vertices and q- edges if f: V(G) →{ 1, 2, . . ., p + q} is injective and the induced function f * defined as f * (uv) = 3 3 3 f(u) + f(v) 2       or 3 3 3 f(u) + f(v) 2       . For all uvE(G) is bijective. Then the resulting edge labels are distinct. A graph that admits a super cube root cube mean labeling f is called a super cube root cube means graph. In this paper we introduce super cube root cube mean labeling and investigate super cube root cube mean labeling of path Pn, Comb graph, ladder graph, pendant vertex attached with comb graph, pendant vertex attached with the ladder graph, CnK1, PnK3 and Fish graph.",
    "ISSN": "2456-5660"
}

From the record as registered (version 2) — the record and its history. Programs: https://registry.smartscholars.in/api.php?action=cite&doi=10.46243%2Fjstj.2020.v5.i1.232 gives all four in one JSON answer.