Denise Sakai Troxell

According to our database1, Denise Sakai Troxell authored at least 24 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Blocking zero forcing processes in Cartesian products of graphs.
Discret. Appl. Math., 2020

On the zero blocking number of rectangular, cylindrical, and Möbius grids.
Discret. Appl. Math., 2020

2017
Radio k-chromatic number of cycles for large k.
Discret. Math. Algorithms Appl., 2017

2015
L(d, 1)-labelings of the edge-path-replacement by factorization of graphs.
J. Comb. Optim., 2015

The minimum span of L(2, 1)-labelings of generalized flowers.
Discret. Appl. Math., 2015

2014
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two.
Discret. Appl. Math., 2014

2013
On the <i>L</i>(2, 1)-labelings of amalgamations of graphs.
Discret. Appl. Math., 2013

Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products.
Australas. J Comb., 2013

2012
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids.
Discret. Appl. Math., 2012

Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips.
Discret. Appl. Math., 2012

2011
Dynamic monopolies and feedback vertex sets in hexagonal grids.
Comput. Math. Appl., 2011

Labeling matched sums with a condition at distance two.
Appl. Math. Lett., 2011

2010
On island sequences of labelings with a condition at distance two.
Discret. Appl. Math., 2010

2007
On the hole index of L(2, 1)-labelings of r-regular graphs.
Discret. Appl. Math., 2007

The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs.
Discret. Appl. Math., 2007

2006
An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs.
IEEE Trans. Circuits Syst. I Regul. Pap., 2006

Introduction to the ITE Special Issue: "Effective Use of Software in the MS/OR Classroom".
INFORMS Trans. Educ., 2006

L(2, 1)-labelings of Cartesian products of two cycles.
Discret. Appl. Math., 2006

2005
On critical trees labeled with a condition at distance two.
Discret. Math., 2005

2003
A Note on the Representation of Unit Interval Graphs: A Link Between Interval Graphs and Semiorders.
Ars Comb., 2003

1996
No-hole k-tuple (r+1)-distant Colorings.
Discret. Appl. Math., 1996

1995
Minimizing the number of holes in 2-distant colorings.
Ars Comb., 1995

1994
Labeling Chordal Graphs: Distance Two Condition.
SIAM J. Discret. Math., 1994

1993
No-hole (r+1)-distant colorings.
Discret. Math., 1993


  Loading...