Ermelinda DeLaViña

11 papers Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2013 J jnl
A parallel algorithm for computing the critical independence number and related sets.
Ars Math. Contemp.
Ermelinda DeLaViña, Craig E. Larson
2012 J jnl
A Characterization of Graphs Where the Independence Number Equals the Radius.
Graphs Comb.
Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller
2011 J jnl
Bounds on the k-domination number of a graph.
Appl. Math. Lett.
Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan
2010 J jnl
Lower bounds for the domination number.
Discuss. Math. Graph Theory
Ermelinda DeLaViña, Ryan Pepper, Bill Waller
2009 J jnl
A note on dominating sets and average distance.
Discret. Math.
Ermelinda DeLaViña, Ryan Pepper, Bill Waller
2009 — conf
Heuristic algorithms for finding reliable lightpath under multiple failures.
ICUMT
Shengli Yuan, William Waller, Ermelinda DeLaViña
2008 J jnl
Spanning Trees with Many Leaves and Average Distance.
Electron. J. Comb.
Ermelinda DeLaViña, Bill Waller
2001 — conf
Graffiti.pc: A Variant of Graffiti.
Graphs and Discovery
Ermelinda DeLaViña
2001 — conf
On Some Conjectures of Griggs and Graffiti.
Graphs and Discovery
Ermelinda DeLaViña, Siemion Fajtlowicz, William Waller
2001 — conf
Some History of the Development of Graffiti.
Graphs and Discovery
Ermelinda DeLaViña
1996 J jnl
Ramseyan Properties of Graphs.
Electron. J. Comb.
Ermelinda DeLaViña, Siemion Fajtlowicz