Discrepancy and signed domination in graphs and hypergraphs
From MaRDI portal
Publication:982615
DOI10.1016/j.disc.2010.03.030zbMath1219.05129arXiv0906.3993OpenAlexW2068445109MaRDI QIDQ982615
Vadim E. Zverovich, Anush Poghosyan
Publication date: 7 July 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.3993
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (3)
The effect of local majority on global majorityin connected graphs ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Further results on the signed Italian domination
Cites Work
- 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
- A note on the lower bounds of signed domination number of a graph
- Signed domination in regular graphs and set-systems
- On the signed domination in graphs
- Inequalities relating domination parameters 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: Discrepancy and signed domination in graphs and hypergraphs