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
Algorithms and hardness results for edge total domination problem in graphs
Michael A. Henning
, Arti Pandey
, Gopika Sharma
, Vikash Tripathi
Mathematics and Applied Mathematics
Indian Institute of Technology Ropar
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithms and hardness results for edge total domination problem in graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Total Domination
100%
Total Dominating Set
100%
Domination Problems
100%
Hardness Results
100%
Minimum Cardinality
40%
Linear-time Algorithm
40%
Bipartite Graph
40%
Chordal Graph
40%
Dominating Set Problem
40%
Maximum Degree
20%
Approximation Algorithms
20%
NP-complete
20%
K-regular Graph
20%
Planar Graph
20%
Chain Graphs
20%
APX-complete
20%
Split Graphs
20%
Cut Vertex
20%
Proper Interval Graph
20%
Graph Classes
20%
Computer Science
Total Domination
100%
Chordal Graph
100%
Bipartite Graph
100%
Subclasses
100%
Cardinality
100%
Approximation Algorithms
50%
Planar Graph
50%
Interval Graph
50%
Mathematics
Edge
100%
Dominating Set
55%
Cardinality
22%
Linear Time
22%
Bipartite Graph
22%
Maximum Degree
11%
Regular Graph
11%
Chain Graph
11%
Planar Graph
11%
Interval Graph
11%