Independent point-set domination in line graphs
From MaRDI portal
(Redirected from Publication:5861708)
Recommendations
Cites work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Characterization of graphs with equal domination numbers and independence numbers
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3885963 (Why is no real title available?)
- scientific article; zbMATH DE number 1247731 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Independent point-set dominating sets in graphs
- Induced cycles in graphs
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
- Point-set domination number of a graph
Cited in
(5)
This page was built for publication: Independent point-set domination in line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5861708)