Dominating Sets

A Dominating Set is a subset of vertices in a graph such that every vertex not in the subset is adjacent to at least one vertex in the subset, distinguishing it from other vertex subsets by its property of dominating all vertices in the graph.

1.5K

Publications

67.7K

Citations

2.3K

Authors

958

Institutions

Publications per year

2017–2026

261

Authors

2.3K

  1. MA
    Michael A. Henning

    University of Johannesburg, South Africa

    122 publications · 4.5K citations

    34

    h-index

  2. TW
    Teresa W. Haynes

    East Tennessee State University, United States

    37 publications · 2K citations

    21

    h-index

  3. ST
    Stephen T. Hedetniemi

    Clemson University, United States

    27 publications · 2.8K citations

    21

    h-index

  4. WW
    Weili Wu

    The University of Texas at Dallas, United States

    28 publications · 2K citations

    20

    h-index

  5. PW
    Peng‐Jun Wan

    Illinois Institute of Technology, United States

    20 publications · 3.3K citations

    18

    h-index

1–5 of 2.3K

Venues

  1. Discrete Mathematics

    145 publications · 5K citations

    37

    h-index

  2. Discrete Applied Mathematics

    99 publications · 3.8K citations

    32

    h-index

  3. Information Processing Letters

    43 publications · 1.7K citations

    23

    h-index

  4. Theoretical Computer Science

    38 publications · 2.1K citations

    23

    h-index

  5. Discussiones Mathematicae Graph Theory

    DMGT · 44 publications · 1.2K citations

    22

    h-index

1–5