WorldCat Identities

Favaron, Odile

Overview
Works: 33 works in 58 publications in 2 languages and 81 library holdings
Roles: Author
Publication Timeline
.
Most widely held works by Odile Favaron
Combinatoire et algorithmique : pour le C1 de licence mathématique et applications fondamentales, MAF : [Université Paris Sud], année 1991-92 by Odile Favaron( Book )

3 editions published in 1991 in French and held by 5 WorldCat member libraries worldwide

Domination and irredundance in the kings graph by Odile Favaron( Book )

2 editions published in 1994 in French and English and held by 4 WorldCat member libraries worldwide

Combinatoire et algorithmique pour le C1 de licence Mathématique et Applications Fondamentales (MAF) by Odile Favaron( Book )

1 edition published in 1990 in French and held by 4 WorldCat member libraries worldwide

Independence, domination, irredundance, and forbidden pairs by Ralph Faudree( Book )

2 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide

Some results on K(r)-covered graphs by O Favaron( Book )

1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide

Global insertion and hamiltonicity in DCT-graphs by A Ainouche( Book )

1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide

On edge-reconstruction of the degree sequence of a graph by Charles Delorme( Book )

2 editions published in 2001 in English and held by 3 WorldCat member libraries worldwide

Total irredundance in graphs by Odile Favaron( Book )

3 editions published in 1999 in English and held by 3 WorldCat member libraries worldwide

Abstract: "For a graph G=(V, E), a set S [subset] V is a total irredundant set if for every vertex v [element] V, N[v] - N[S - [v]] is not empty. The total irredundance number ir[subscript t](G) is the minimum cardinality of any maximal total irredundant set of G and the upper total irredundance number IR[subscript t](G) is the maximum cardinality of any total irredundant set of G. We investigate total irredundance numbers of graphs."
Ratios of domination parameters by O Favaron( Book )

1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide

A Bound on the diameter of domination-critical graphs by Odile Favaron( Book )

2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide

Distance-k independent domination sequences by Odile Favaron( Book )

3 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide

Abstract: "For a graph G=(V, E), a set S [subset of] V is a k-packing if the distance between every pair of distinct vertices in S is at least K+1, and p[subscript k](G) is the maximum cardinality of a k-packing. A set S [subset of] V is a distance-k dominating set if for each vertex u [element of] V - S, the distance d(u, v) [<or =] k for some v [element of] S. Call a vertex set S a k-independent dominating set if it is both a k-packing and a distance-k dominating set, and let the k-independent domination number i[subscript k](G) be the minimum cardinality of a k-independent dominating set. We show that deciding if a graph G is not k-equipackable (that is, i[subscript k](G) <p[subscript k](G) is an NP-complete problem, and we present a lower bound on i[subscript k](G). Our main result shows that the sequence (i₁(G), i₂(G), i₃(G) ...) is surprisingly not monotone. In fact, the difference i[subscript k+1](G)-i[subscript k](G) can be arbitrarily large."
Equimatchable factor-critical graphs by Odile Favaron( Book )

1 edition published in 1984 in English and held by 3 WorldCat member libraries worldwide

Clique covering and degree conditions for hamiltonicity in claw-free graphs by Odile Favaron( Book )

3 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide

Abstract: "By using the closure concept in claw-free graphs, we give a method for characterizing all 2-connected claw-free graphs with limited clique covering number, thus providing a method for finding classes of nonhamiltonian exceptions for any degree condition for hamiltonicity of type [sigma][subscript k](G)> n+(k-2)² for arbitrary k and sufficiently large n and [sigma](G). The method is illustrated by proving that every 2-connected claw-free graph G with [sigma](G) [> or =] n+16/6 and n [> or =] 98 is either hamiltonian or belongs to a family of easily described exceptions."
Independence, irredundance, degrees and chromatic number in graphs by Gábor Bacso( Book )

3 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide

Abstract: "Let [beta](G) and IR(G) denote the independence number and the upper irredundance number of a graph G. We prove that in any graph of order n, minimum degree [sigma] and maximum degree [delta] [do not equal] 0, IR(G) [<or =] n/(1 + [sigma]/[delta]) and IR(G) - [beta](G) [<or =] [delta]-2/2[delta] n. The two bounds are attained by arbitrarily large graphs. The second one proves a conjecture by Rautenbach related to the case [delta] = 3. When the chromatic number [subscript X] of G is less than [delta], it can be improved to IR(G) - [beta](G) [<or =] x-2/2x n in any non-empty graph of order n [> or =] 2."
Stability, domination and irredundance in a graph by Odile Favaron( Book )

1 edition published in 1984 in English and held by 3 WorldCat member libraries worldwide

On Well-K-Covered graphs by O Favaron( Book )

1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide

From irredundance to annihilation : a brief overview of some domination parameters of graphs by Odile Favaron( Book )

2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide

Abstract: "We first remind some important results related to the classical parameters of independence, domination and irredundance of a graph. Then we show how the characterization of maximal irredundant sets leads to the introduction of annihilation concepts."
Domination subdivision numbers in graphs by Odile Favaron( Book )

2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide

Hamiltonicity and minimum degree in 3-connected claw-free graphs by Odile Favaron( Book )

2 editions published in 1999 in English and held by 2 WorldCat member libraries worldwide

Caterpillars and total domination in graphs with minimum degree three by O Favaron( Book )

2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide

Abstract: "A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number of G, denoted by [gamma]t(G), is the minimum cardinality of a total dominating set of G. We prove that if G is a graph of order n with minimum degree at least 3, then [gamma]t(G) [<or =] 7n/13."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.83 (from 0.79 for Independen ... to 0.94 for Combinatoi ...)

Languages
English (33)

French (5)