A solution to an open problem on lower against number in graphs
Combinatorics
2019-08-27 v1
Abstract
In [1] 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.
Keywords
Cite
@article{arxiv.1408.6713,
title = {A solution to an open problem on lower against number in graphs},
author = {Babak Samadi},
journal= {arXiv preprint arXiv:1408.6713},
year = {2019}
}