加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本