INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH
From MaRDI portal
Publication:4973379
DOI10.17654/DM019010001zbMath1425.05122OpenAlexW2791634833MaRDI QIDQ4973379
No author found.
Publication date: 27 November 2019
Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/dm019010001
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination alteration sets in graphs
- The bondage number of a graph
- Connected domsaturation number of a graph
- Domsaturation number of a graph
- Independent domination in graphs: A survey and recent results
- Independence saturation and extended domination chain in graphs
- A Characterization of the extended DII-sequence
- The Two-Triangle Case of the Acquaintance Graph
This page was built for publication: INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH