scientific article; zbMATH DE number 3747181

MaRDI QIDQ3933018zbMATH OpenFDO

Authors H. B. Walikar, Renu C. Laskar

Publication date 1981

zbMATH Keywords

dominating setindependent set

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(26)

• A note on total domination
• A linear algorithm for finding a minimum dominating set in a cactus
• An extremal problem for edge domination insensitive graphs
• Chordal graphs and upper irredundance, upper domination and independence
• Domatically critical and domatically full graphs
• The least point covering and domination numbers of a graph
• On packing and covering numbers of graphs
• The domatic number problem
• A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
• On graphs with equal domination and covering numbers
• Characterization of graphs with equal domination and covering number
• Domination in intersecting hypergraphs
• Well irredundant graphs
• The weighted perfect domination problem and its variants
• Nordhaus-Gaddum inequalities for domination in graphs
• Graphs with equal domination and covering numbers
• Domination and matching in power and generalized power hypergraphs
• Equality of domination and transversal numbers in hypergraphs
• Factor domination in graphs
• On the Algorithmic Complexity of Total Domination
• On f-domination number of a graph
• Conical and spherical graphs
• scientific article; zbMATH DE number 817208 (Why is no real title available?)
• Bibliography on domination in graphs and some basic definitions of domination parameters
• The weighted perfect domination problem
• Cores of simplicial complexes

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 Q3933018)