Skip to main navigation
Skip to search
Skip to main content
University of Johannesburg Home
Search content at University of Johannesburg
Home
Scholars
Research entities
Research output
Press/Media
Equipment & facilities
Prestigious awards
Algorithm and hardness result for semipaired domination in graphs
Michael A. Henning
, Arti Pandey
, Vikash Tripathi
Mathematics and Applied Mathematics
Indian Institute of Technology Ropar
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithm and hardness result for semipaired domination in graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Domination in Graphs
100%
Dominating Set
100%
Semipaired Domination
100%
Hardness Results
100%
Decision Problems
40%
Cardinality
40%
Domination Problems
40%
Minimum Cardinality
20%
Isolated Vertex
20%
NP-complete
20%
Semipaired Domination number
20%
Linear-time Algorithm
20%
Positive Integer
20%
Chordal Graph
20%
Split Graphs
20%
Element Set
20%
Mathematics
Dominating Set
100%
Cardinality
60%
Isolated Vertex
20%
domination number γ
20%
Element Subset
20%
Positive Integer
20%
Element Set
20%
Linear Time
20%