scientific article; zbMATH DE number 436064
From MaRDI portal
Publication:3139841
zbMATH Open0798.68135MaRDI QIDQ3139841FDOQ3139841
Authors: Ashok T. Amin, Peter Slater 
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
- Neighbourhood total domination in graphs
- Neighborhood connected domination in graphs
- Bounds on neighborhood total domination in graphs
- A note on neighborhood total domination in graphs
- Bounds on neighborhood total domination number in graphs
- Neighborhood total domination of a graph and its complement
- Neighborhood connected edge domination in graphs
- Neighborhood connected perfect domination in graphs
- Neighborhood and domination polynomials of graphs
- On neighborhood graphs: domination, coloring and other properties
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cited In (17)
- Odd neighborhood transversals on grid graphs
- Parity dominating sets in grid graphs
- When an optimal dominating set with given constraints exists
- Parity dimension for graphs
- Odd and residue domination numbers of a graph
- \((1, j)\)-set problem in graphs
- A solitaire game played on 2-colored graphs
- \([1,2]\)-domination in graphs
- Title not available (Why is that?)
- Algorithms for unipolar and generalized split graphs
- Lights Out On A Random Graph
- A Survey of the Game “Lights Out!”
- \([1,2]\)-sets in graphs
- Connected odd dominating sets in graphs
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Combinatorial properties of a general domination problem with parity constraints
- On the complexity of dominating set problems related to the minimum all-ones problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139841)
