A solution to an open problem on lower against number in graphs

DOI10.1007/S10878-014-9813-2MaRDI QIDQ266038zbMATHOpenAlexFDO

Authors B. Samadi

Publication date 13 April 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.6713

zbMATH Keywords

lower against numbermaximal negative functionnegative function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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.

Recommendations

• Lower against number in graphs
• On lower bounds for numbered complete graphs
• A lower bound on the independence number of a graph
• A lower bound on solutions of Chartrand's problem
• A new lower bound on the independence number of graphs

Cites work

• Lower against number in graphs
• Voting 'Against' in regular and nearly regular graphs

Cited in

(2)

• Lower against number in graphs
• Algorithms and Computation

This page was built for publication: A solution to an open problem on lower against number in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266038)