Skip to main content

Research Repository

Advanced Search

Discrepancy and signed domination in graphs and hypergraphs

Poghosyan, A.; Zverovich, Vadim

Discrepancy and signed domination in graphs and hypergraphs Thumbnail


Authors

A. Poghosyan



Abstract

For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and -1 such that the closed neighbourhood of every vertex contains more +1's than -1's. This concept is closely related to combinatorial discrepancy theory as shown by Füredi and Mubayi [Z. Füredi, D. Mubayi, Signed domination in regular graphs and set-systems, J. Combin. Theory Ser. B 76 (1999) 223-239]. The signed domination number of G is the minimum of the sum of colours for all vertices, taken over all signed domination functions of G. In this paper, we present new upper and lower bounds for the signed domination number. These new bounds improve a number of known results. © 2010 Elsevier B.V. All rights reserved.

Citation

Poghosyan, A., & Zverovich, V. (2010). Discrepancy and signed domination in graphs and hypergraphs. Discrete Mathematics, 310(15-16), 2091-2099. https://doi.org/10.1016/j.disc.2010.03.030

Journal Article Type Article
Publication Date Aug 28, 2010
Deposit Date Nov 12, 2010
Publicly Available Date Oct 27, 2016
Journal Discrete Mathematics
Print ISSN 0012-365X
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 310
Issue 15-16
Pages 2091-2099
DOI https://doi.org/10.1016/j.disc.2010.03.030
Keywords graphs, signed domination function, signed domination number
Public URL https://uwe-repository.worktribe.com/output/987626
Publisher URL http://dx.doi.org/10.1016/j.disc.2010.03.030

Files

Discrepancy_and_Signed_Domination_in_Graphs_and_Hypergraphs.pdf (160 Kb)
PDF







You might also like



Downloadable Citations