Skip to main navigation
Skip to search
Skip to main content
University of Johannesburg Home
Home
Scholars
Research entities
Research output
Press/Media
Equipment & facilities
Prestigious awards
Search by expertise, name or affiliation
Algorithmic aspects of semitotal domination in graphs
Michael A. Henning
, Arti Pandey
Mathematics and Applied Mathematics
Indian Institute of Technology Ropar
Research output
:
Contribution to journal
›
Article
›
peer-review
35
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithmic aspects of semitotal domination in graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Domination in Graphs
100%
Eternal Dominating Set
100%
Semitotal Domination
100%
Maximum Degree
66%
NP-complete
66%
Minimum Cardinality
33%
Dominating Set
33%
Approximation Algorithms
33%
Planar Graph
33%
Positive Integer
33%
Cardinality
33%
Interval Graphs
33%
Bipartite Graph
33%
APX-complete
33%
Approximation Ratio
33%
Polynomial-time Algorithm
33%
Split Graphs
33%
General Graphs
33%
Chordal Bipartite Graphs
33%
Mathematics
Dominating Set
100%
Maximum Degree
50%
Cardinality
50%
Bipartite Graph
50%
Positive Integer
25%
Polynomial Time
25%
Planar Graph
25%
Interval Graph
25%