𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fibonacci index and stability number of graphs: a

✍ Scribed by Véronique Bruyère; Hadrien Mélot

Publisher
Springer US
Year
2009
Tongue
English
Weight
668 KB
Volume
18
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stability number and [a,b]-factors in gr
Stability number and [a,b]-factors in graphs
✍ Mekkia Kouider; Zbigniew Lonc 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract A spanning subgraph whose vertices have degrees belonging to the interval [__a,b__], where __a__ and __b__ are positive integers, such that __a__ ≤ __b__, is called an [__a,b__]‐factor. In this paper, we prove sufficient conditions for existence of an [__a,b__]‐factor, a connected [__a,

On the stability number of AH-free graph
On the stability number of AH-free graphs
✍ A. Hertz; D. de Werra 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract We describe a new class of graphs for which the stability number can be obtained in polynomial time. The algorithm is based on an iterative procedure that, at each step, builds from a graph __G__ a new graph __G^l^__ that has fewer nodes and has the property that α(__G^l^__) = α(__G__)

On color polynomials of Fibonacci graphs
On color polynomials of Fibonacci graphs
✍ Sherif El-Basil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj.' Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here appl