Independent point-set domination in line graphs
DOI10.1080/09728600.2021.1995307zbMATH Open1483.05119OpenAlexW3212467123MaRDI QIDQ5861708FDOQ5861708
Authors: Purnima Gupta, Alka Goyal, Ranjana Jain 
Publication date: 2 March 2022
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2021.1995307
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Induced cycles in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Point-set domination number of a graph
- Title not available (Why is that?)
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Independent point-set dominating sets in graphs
- Characterization of graphs with equal domination numbers and independence numbers
- Title not available (Why is that?)
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
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)
