Domination criticality in product graphs
From MaRDI portal
Publication:896090
DOI10.1016/J.AKCEJ.2015.06.003zbMATH Open1360.05134OpenAlexW1440088849MaRDI QIDQ896090FDOQ896090
Publication date: 11 December 2015
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2015.06.003
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex domination-critical graphs
- Domination critical graphs
- Title not available (Why is that?)
- The Domination Number of Grids
- Structural Analysis of Complex Networks
- Structural Analysis of Complex Networks
- Some properties of 3-domination-critical graphs
- Connected domination critical graphs.
- Connected domination: vertex criticality and matchings
- THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS
Cited In (3)
This page was built for publication: Domination criticality in product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896090)