scientific article; zbMATH DE number 436064

MaRDI QIDQ3139841zbMATH OpenFDO

Authors Ashok T. Amin, Peter Slater

Publication date 11 November 1993

zbMATH Keywords

parityseries-parallel graphsneighborhood domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

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

Cited in

(17)

• On \([1,2]\)-domination in trees
• When an optimal dominating set with given constraints exists
• Odd neighborhood transversals on grid graphs
• Algorithms for unipolar and generalized split graphs
• A solitaire game played on 2-colored graphs
• Lights Out On A Random Graph
• \([1,2]\)-sets in graphs
• Combinatorial properties of a general domination problem with parity constraints
• Parity dominating sets in grid graphs
• Connected odd dominating sets in graphs
• A Survey of the Game “Lights Out!”
• \([1,2]\)-domination in graphs
• On the complexity of dominating set problems related to the minimum all-ones problem
• Odd and residue domination numbers of a graph
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• Parity dimension for graphs
• \((1, j)\)-set problem in graphs

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)