Odile Favaron | Academic Influence

Odile Favaron's AcademicInfluence.com Rankings

Odile Favaron

Mathematics

#5317

World Rank

#7492

Historical Rank

Measure Theory

#3439

World Rank

#4057

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Odile Favaron's Degrees

PhD Mathematics Université Paris Cité
Bachelors Mathematics University of Bordeaux

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Odile Favaron Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Odile Zink-Favaron is a French mathematician known for her research in graph theory, including work on well-covered graphs, factor-critical graphs, spectral graph theory, Hamiltonian decomposition, and dominating sets. She is retired from the Laboratory for Computer Science at the University of Paris-Sud.

(See a Problem?)

Odile Favaron's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Some eigenvalue properties in graphs (conjectures of Graffiti - II) (1993) (232)
Hamiltonian decomposition of Cayley graphs of degree 4 (1989) (146)
k-Domination and k-Independence in Graphs: A Survey (2012) (146)
Contributions to the theory of domination, independence and irredundance in graphs (1981) (120)
Very well covered graphs (1982) (103)
Signed domination in regular graphs (1996) (97)
Paired-Domination in Claw-Free Cubic Graphs (2004) (95)
Offensive alliances in graphs (2004) (91)
On k-factor-critical graphs (1996) (83)
On the Roman domination number of a graph (2009) (78)
Total domination in graphs with minimum degree three (2000) (68)
On a conjecture of Fink and Jacobson concerning k-domination and k-dependence (1985) (63)
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (1999) (61)
Closure and stable Hamiltonian properties in claw-free graphs (2000) (59)
On the residue of a graph (1991) (52)
On the Randic Image index (2002) (50)
Two relations between the parameters of independence and irredundance (1988) (50)
Independence and 2-domination in trees (2005) (48)
Bounds on total domination in claw-free cubic graphs (2008) (45)
The diameter of domination k-critical graphs (1994) (43)
Strong edge colorings of graphs (1996) (38)
Locating-domination, 2-domination and independence in trees (2008) (37)
Independence and hamiltonicity in 3-domination-critical graphs (1997) (36)
Stability, domination and irredundance in a graph (1986) (34)
Edge-vulnerability and mean distance (1989) (32)
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups (1992) (31)
On k‐domination and minimum degree in graphs (2008) (31)
On k-domination and minimum degree in graphs (2008) (26)
Total domination in claw-free graphs with minimum degree 2 (2008) (25)
A characterization of (γ, i)-trees (2000) (23)
Ratios of some domination parameters in trees (2008) (23)
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs (2001) (21)
Total domination and total domination subdivision numbers (2007) (21)
Paired-Domination Subdivision Numbers of Graphs (2009) (20)
Clique covering and degree conditions for hamiltonicity in claw-free graphs (2001) (20)
Equimatchable factor‐critical graphs (1986) (20)
Independent [1, k]-sets in graphs (2014) (20)
On the outer-connected domination in graphs (2013) (19)
Total domination and total domination subdivision number of a graph and its complement (2008) (19)
Sequences, claws and cyclability of graphs (1996) (18)
Domination subdivision numbers of trees (2009) (18)
A note on the irredundance number after vertex deletion (1993) (17)
Upper total domination in claw-free graphs (2003) (17)
Maximal k-independent sets in graphs (2008) (17)
Regular path decompositions of odd regular graphs (2010) (17)
Bounding the total domination subdivision number of a graph in terms of its order (2011) (17)
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees (2003) (16)
Paired-domination number of a graph and its complement (2008) (16)
Upper total domination in claw‐free graphs (2003) (14)
The product of the independent domination numbers of a graph and its complement (1991) (14)
On equality in an upper bound for domination parameters of graphs (1997) (14)
Biclosure and bistability in a balanced bipartite graph (1995) (14)
Extendability and factor-criticality (2000) (14)
Pancyclism and small cycles in graphs (1996) (14)
On domination and annihilation in graphs with claw-free blocks (2001) (14)
Disproof of a Conjecture on the Subdivision Domination Number of a Graph (2008) (14)
Independence and upper irredundance in claw-free graphs (2003) (13)
Irredundance in inflated graphs (1998) (13)
Factor-criticality and matching extension in DCT-graphs (1997) (13)
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (2009) (13)
On k-dependent domination (2002) (12)
Irredundance and domination in kings graphs (2003) (12)
(2,k)-Factor-Critical Graphs and Toughness (1999) (12)
On k-independence in graphs with emphasis on trees (2007) (12)
An Ore-type condition for pancyclability (1999) (11)
Global Alliances and Independent Domination in Some Classes of Graphs (2008) (11)
On the total domination subdivision number in some classes of graphs (2010) (10)
(3,k)-Factor-Critical Graphs and Toughness (1999) (10)
Minimally k-factor-critical graphs (1998) (10)
Total irredundance in graphs (2002) (9)
Global insertion and hamiltonicity in DCT-graphs (1998) (9)
Inflated graphs with equal independence number and upper irredundance number (2001) (9)
Irredundant and perfect neighborhood sets in graphs and claw-free graphs (1999) (9)
The complete closure of a graph (1993) (8)
Inequalities of Nordhaus-Gaddum type for doubly connected domination number (2010) (7)
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs (2006) (7)
On the total outer-connected domination in graphs (2014) (7)
Even Factors of Large Size (2014) (7)
On total domination and support vertices of a tree (2010) (7)
Irredundance saturation number of a graph (2010) (6)
Proof of a conjecture on game domination (2010) (6)
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs (1998) (6)
Total Domination in K5- and K6-covered graphs (2008) (6)
On the bipartite independence number of a balanced bipartite graph (1993) (6)
Signed k-domatic numbers of graphs (2015) (6)
An inequality chain of domination parameters for trees (1998) (5)
Ramsey properties of generalised irredundant sets in graphs (2001) (5)
Average distance in the strong product of graphs (2014) (5)
Total domination in Kr-covered graphs (2004) (5)
On the sizes of least common multiples of several pairs of graphs (1996) (5)
Matchings and total domination subdivision number in graphs with few induced 4-cycles (2010) (5)
Total domination in K 5 - and K 6 -covered graphs (2008) (4)
FROM IRREDUNDANCE TO ANNIHILATION: A BRIEF OVERVIEW OF SOME DOMINATION PARAMETERS OF GRAPHS (2000) (4)
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2 (1993) (4)
Neighborhood unions and regularity in graphs (2001) (4)
Open irredundance and maximum degree in graphs (2008) (4)
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph (2021) (4)
Game domination subdivision number of a graph (2015) (3)
Connected Domination (2020) (3)
On m-centers in Pt-free graphs (1994) (3)
Shortest walks in almost claw-free graphs (1996) (3)
A parameter linked with G-factors and the binding number (1991) (3)
Least domination in a graph (1996) (3)
On the reconstruction of the degree sequence (2002) (3)
On i--ER-critical graphs (2004) (3)
A sufficient condition for oriented graphs to be Hamiltonian (1986) (3)
The B-Domatic Number of a Graph (2013) (2)
Irredundance in grids (1998) (2)
Independence, irredundance, degrees and chromatic number in graphs (2002) (2)
A New Bound on the Total Domination Subdivision Number (2009) (2)
Changing upper irredundance by edge addition (2003) (2)
Total domination in K₅- and K₆-covered graphs (2008) (1)
On the outer-connected domination in graphs (2011) (1)
Edge k-q-Colorability of Graphs (2018) (1)
Generalised Ramsey Numbers with respect to Classes of Graphs (2001) (1)
k-Domination and k-Independence in Graphs: A Survey (2011) (1)
On i-minus-Edge-Removal-critical graphs (2000) (0)
Edge kq-Colorability of Graphs (2018) (0)
On Equality in an Upper Bound for the Domination Number with Respect to Nondegenerate Properties (2020) (0)
WITHDRAWN: Matchings and total domination subdivision number in graphs (2012) (0)
Partial Domination and Irredundance Numbers in Graphs (2022) (0)
On the total outer-connected domination in graphs (2012) (0)
Universal maximal packing functions of graphs (1996) (0)
Total outer-Connected domination subdivision numbers in graphs (2013) (0)
T-partitions and S-complete T-partitions of a Graph (2006) (0)
Game domination subdivision number of a graph (2013) (0)
Minimum independent generalized t-degree and independence number in K1, r+1-free graphs (1997) (0)
Inequalities between Partial Domination and Independent Partial Domination in Graphs (2020) (0)

This paper list is powered by the following services:

Other Resources About Odile Favaron

en.wikipedia.org

What Schools Are Affiliated With Odile Favaron?

Odile Favaron is affiliated with the following schools: