Discrepancy and signed domination in graphs and hypergraphs
From MaRDI portal
Publication:982615
DOI10.1016/j.disc.2010.03.030zbMath1219.05129arXiv0906.3993MaRDI QIDQ982615
Anush Poghosyan, Vadim E. Zverovich
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
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C22: Signed and weighted graphs
Cites Work
- ``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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item