An upper bound on the independence number of a graph computable in polynomial-time

Authors:
Carlos J. Luz
Affiliations:
Escola Superior de Tecnologia do Instituto Politécnico de Setúbal, 2900 Setúbal, Portugal
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 4

On the Shannon capacity of a graph

IEEE Transactions on Information Theory

Convex Quadratic Programming Approachto the Maximum Matching Problem

Journal of Global Optimization
Convex Quadratic Programming Approach to the Maximum Matching Problem

Journal of Global Optimization
Improving an Upper Bound on the Stability Number of a Graph

Journal of Global Optimization
Improving an upper bound on the size of k-regular induced subgraphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

An upper bound on the independence number of an undirected graph is presented. The bound is deduced by applying the theory of lagrangian duality to a quadratic formulation of the problem. A characterization of the graphs that attain the proposed bound and a heuristic for approaching the largest independence set of any graph are also given.