✦ LIBER ✦

On a Polynomial Fractional Formulation for Independence Number of a Graph

✍ Scribed by Balabhaskar Balasundaram; Sergiy Butenko

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 155 KB
Volume: 35
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-005-5185-6

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independent set problem.

📜 SIMILAR VOLUMES

On a Polynomial Fractional Formulation f

On a Polynomial Fractional Formulation for Independence Number of a Graph

✍ Balabhaskar Balasundaram; Sergiy Butenko 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 155 KB

On the Fractional Intersection Number of

On the Fractional Intersection Number of a Graph

✍ Edward R. Scheinerman; Ann N. Trenk 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 101 KB

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB

On the bipartite independence number of

On the bipartite independence number of a balanced bipartite graph

✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere