Ermelinda DeLaViña

According to our database, Ermelinda DeLaViña authored at least 11 papers between 1996 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2013

A parallel algorithm for computing the critical independence number and related sets.

Ermelinda DeLaViña, Craig E. Larson

Ars Math. Contemp., 2013

2012

A Characterization of Graphs Where the Independence Number Equals the Radius.

Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller

Graphs Comb., 2012

2011

Bounds on the k-domination number of a graph.

Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan

Appl. Math. Lett., 2011

2010

Lower bounds for the domination number.

Ermelinda DeLaViña, Ryan Pepper, Bill Waller

Discuss. Math. Graph Theory, 2010

2009

A note on dominating sets and average distance.

Ermelinda DeLaViña, Ryan Pepper, Bill Waller

Discret. Math., 2009

Heuristic algorithms for finding reliable lightpath under multiple failures.

Shengli Yuan, William Waller, Ermelinda DeLaViña

Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

2008

Spanning Trees with Many Leaves and Average Distance.

Ermelinda DeLaViña, Bill Waller

Electron. J. Comb., 2008

2001

On Some Conjectures of Griggs and Graffiti.

Ermelinda DeLaViña, Siemion Fajtlowicz, William Waller

Proceedings of the Graphs and Discovery, 2001

Some History of the Development of Graffiti.

Ermelinda DeLaViña

Proceedings of the Graphs and Discovery, 2001

Graffiti.pc: A Variant of Graffiti.

Ermelinda DeLaViña

Proceedings of the Graphs and Discovery, 2001

1996

Ramseyan Properties of Graphs.

Ermelinda DeLaViña, Siemion Fajtlowicz

Electron. J. Comb., 1996