A solution to an open problem on lower against number in graphs
B Samadi - Journal of Combinatorial Optimization, 2016 - Springer
Journal of Combinatorial Optimization, 2016•Springer
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.
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.
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.
Springer
Showing the best result for this search. See all results