Ermelinda DeLaViña | Academic Influence

Ermelinda DeLaViña's AcademicInfluence.com Rankings

Ermelinda DeLaViña

Mathematics

#3875

World Rank

#5614

Historical Rank

Measure Theory

#4343

World Rank

#5111

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Ermelinda DeLaViña's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Ermelinda DeLaViña Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ermelinda DeLaViña is an American mathematician specializing in graph theory. She is a professor in the Computer and Mathematical Sciences Department of the University of Houston–Downtown, where she is also Associate Dean of the College of Science and Technology.

(See a Problem?)

Ermelinda DeLaViña'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

On Total Domination in Graphs (2012) (468)
Spanning Trees with Many Leaves and Average Distance (2008) (46)
Bounds on the k-domination number of a graph (2011) (28)
Some History of the Development of Graffiti (2001) (25)
Lower bounds for the domination number (2010) (21)
Some conjectures of Graffiti . pc on total domination (2007) (19)
Graffiti . pc on the 2-domination number of a graph (2010) (18)
A note on dominating sets and average distance (2009) (12)
Graffiti.pc: A Variant of Graffiti (2001) (10)
On total domination and support vertices of a tree (2010) (7)
INDEPENDENCE , RADIUS AND HAMILTONIAN PATHS (2006) (6)
A parallel algorithm for computing the critical independence number and related sets (2012) (5)
A NOTE ON A CONJECTURE OF HANSEN ET (2008) (4)
On Some Conjectures of Griggs and Graffiti (2001) (3)
Graffiti . pc on the total domination number of a tree (2009) (3)
Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs (3)
Ramseyan Properties of Graphs (1996) (3)
Heuristic algorithms for finding reliable lightpath under multiple failures (2009) (3)
A Characterization of Graphs Where the Independence Number Equals the Radius (2012) (2)
Graffiti . pc on the k-independence number of a graph (2)
Graffiti . pc on the Independent-Domination Number of a Graph (1)
Searching for diamonds (2011) (1)
A Characterization of Graphs Where the Independence Number Equals the Radius (2011) (0)
Graffiti . pc : A Variant of Graffiti Ermelinda DeLaVina (0)
Graffiti . pc : A Variant of Graffiti Ermelinda DeLaVina (0)

This paper list is powered by the following services:

Other Resources About Ermelinda DeLaViña

en.wikipedia.org

What Schools Are Affiliated With Ermelinda DeLaViña?

Ermelinda DeLaViña is affiliated with the following schools: