Total Labeling

Total Labeling is a type of graph labeling in which both vertices and edges are assigned labels from a set of integers, typically such that the induced vertex weights or edge weights satisfy specific arithmetic or combinatorial conditions.

63

Publications

2.1K

Citations

138

Authors

65

Institutions

Publications per year

2017–2026

7

Authors

138

  1. AA
    Ali Ahmad

    Jazan University, Saudi Arabia

    8 publications · 202 citations

    8

    h-index

  2. MB
    Martin Bača

    Technical University of Košice, Slovakia

    8 publications · 205 citations

    8

    h-index

  3. MM
    Mirka Miller

    University of Newcastle Australia, Australia

    8 publications · 204 citations

    8

    h-index

  4. KA
    Kiki Ariyanti Sugeng

    University of Indonesia, Indonesia

    4 publications · 58 citations

    4

    h-index

  5. DD
    Dafik Dafik

    Universitas Jember, Indonesia

    4 publications · 70 citations

    4

    h-index

1–5 of 138

Venues

  1. Discrete Mathematics

    4 publications · 64 citations

    4

    h-index

  2. Discussiones Mathematicae Graph Theory

    DMGT · 4 publications · 181 citations

    4

    h-index

  3. Ars Combinatoria

    4 publications · 80 citations

    4

    h-index

  4. Procedia Computer Science

    3 publications · 56 citations

    3

    h-index

  5. 3

    h-index

1–5