Abstract
In Wang (Appl Anal Discret Math 4:207–218, 2010) the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of order and maximum degree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wang C (2010) Voting against in regular and nearly regular graphs. Appl Anal Discret Math 4:207–218
West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River
Zelinka B, On signed 2-independence number of graphs, manuscript.
Zhao W (2012) Lower against number in graphs. Int J Pure Appl Math 77:149–155
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Samadi, B. A solution to an open problem on lower against number in graphs. J Comb Optim 31, 1130–1133 (2016). https://doi.org/10.1007/s10878-014-9813-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9813-2