Independent point-set domination in line graphs
From MaRDI portal
Publication:5861708
DOI10.1080/09728600.2021.1995307zbMath1483.05119OpenAlexW3212467123MaRDI QIDQ5861708
Ranjana Jain, Purnima Gupta, Alka Goyal
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced cycles in graphs
- Characterization of graphs with equal domination numbers and independence numbers
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
- Point-set domination number of a graph
- 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
- Independent point-set dominating sets in graphs