Signed domination in regular graphs and set-systems

DOI10.1006/jctb.1999.1905zbMath0933.05117OpenAlexW2086536366MaRDI QIDQ1306310

Dhruv Mubayi, Zoltan Fueredi

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1905

zbMATH Keywords

signed domination numberHadamard matrixhypergraphsdiscrepancyrandom covering

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (19)

\(k\)-subdomination in graphs ⋮ Complexity of majority monopoly and signed domination problems ⋮ On the signed domination number of some Cayley graphs ⋮ Upper bounds on the signed edge domination number of a graph ⋮ Signed Roman domination in graphs ⋮ Signed total domination in graphs. ⋮ Lower bounds on several versions of signed domination number ⋮ The effect of local majority on global majorityin connected graphs ⋮ Discrepancy and signed domination in graphs and hypergraphs ⋮ Signed Roman \(k\)-domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Further results on the signed Italian domination ⋮ Upper bounds on the upper signed total domination number of graphs ⋮ Unnamed Item ⋮ Signed domination numbers of a graph and its complement ⋮ On the domination and signed domination numbers of zero-divisor graph ⋮ Signed Roman \(k\)-domination in trees ⋮ SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``Integer-making theorems
• Roth's estimate of the discrepancy of integer sequences is nearly sharp
• Balancing families of sets
• Transversal numbers of uniform hypergraphs
• Inequalities relating domination parameters in cubic graphs
• Some remarks on domination in cubic graphs
• Signed domination in regular graphs
• Six Standard Deviations Suffice
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Signed domination in regular graphs and set-systems