Weak edge-degree domination in hypergraphs

DOI10.1007/s10587-006-0008-6zbMath1164.05415OpenAlexW2171863198MaRDI QIDQ3599858

Purnima Gupta, Belmannu Devadas Acharya

Publication date: 9 February 2009

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/31019

zbMATH Keywords

hypergraphgraph theoryindependent domination numberweak degree domination number

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A characterization of hypergraphs with large domination number ⋮ 2-Point set domination in separable graphs ⋮ Hypergraphs with large domination number and with edge sizes at least three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On hypergraphs without significant cycles
• On the cyclomatic number of a hypergraph
• A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree
• Strong weak domination and domination balance in a graph
• The cyclicity of a hypergraph
• Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality