Renu C. Laskar

44 papers Journal 44
YearRankTypeTitle / Venue / Authors
2020 J jnl
New resolvability parameters of graphs.
AKCE Int. J. Graphs Comb.
Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder
2018 J jnl
On α-Domination in Graphs.
Graphs Comb.
Angsuman Das, Renu C. Laskar, Nader Jafari Rad
2013 J jnl
Path-neigborhood graphs.
Discuss. Math. Graph Theory
Renu C. Laskar, Henry Martyn Mulder
2012 J jnl
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.
Australas. J Comb.
Renu C. Laskar, Henry Martyn Mulder, Beth Novick
2012 J jnl
Minimal rankings of the Cartesian product
Discuss. Math. Graph Theory
Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone
2009 J jnl
Fall colouring of bipartite graphs and cartesian products of graphs.
Discret. Appl. Math.
Renu C. Laskar, Jeremy Lyle
2009 J jnl
On irreducible no-hole
Networks
Renu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando
2006 J jnl
Simultaneous graph parameters: Factor domination and factor total domination.
Discret. Math.
Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar
2006 J jnl
t-partitions and s-complete t-partitions of a graph.
Australas. J Comb.
Odile Favaron, Renu C. Laskar, Dieter Rautenbach
2005 J jnl
An algorithm for partial Grundy number on trees.
Discret. Math.
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae
2005 J jnl
Generalized subgraph-restricted matchings in graphs.
Discret. Math.
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar
2004 J jnl
Offensive alliances in graphs.
Discuss. Math. Graph Theory
Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs
2004 J jnl
On 3-simplicial vertices in planar graphs.
Discuss. Math. Graph Theory
Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder
2003 J jnl
Factor domination and minimum degree.
Discret. Math.
Peter Dankelmann, Renu C. Laskar
2003 J jnl
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs.
Electron. Notes Discret. Math.
Renu C. Laskar, John Villalpando
2003 J jnl
On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discret. Math.
Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins
2000 J jnl
alpha-Domination.
Discret. Math.
Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus
1999 J jnl
Domination Using Induced Cliques in Graphs.
Ars Comb.
Jean E. Dunbar, Johannes H. Hattingh, Renu C. Laskar, Lisa R. Markus
1999 J jnl
Further Results on Minimal Rankings.
Ars Comb.
J. Ghoshal, Renu C. Laskar, Dan Pillone
1999 J jnl
Restrained domination in graphs.
Discret. Math.
Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus
1998 J jnl
On weak domination in graphs.
Ars Comb.
Johannes H. Hattingh, Renu C. Laskar
1997 J jnl
The bondage and reinforcement numbers of gamma
Discret. Math.
Gayla S. Domke, Renu C. Laskar
1996 J jnl
Cyclic gossiping times for some classes of graphs.
Networks
James A. Knisely, Renu C. Laskar
1996 J jnl
Minimal rankings.
Networks
J. Ghoshal, Renu C. Laskar, Dan Pillone
1995 J jnl
Nearly perfect sets in graphs.
Discret. Math.
Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar
1994 J jnl
Periodic gossiping on trees.
Discret. Appl. Math.
Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar
1993 J jnl
Introduction.
Discret. Appl. Math.
Martin Charles Golumbic, Renu C. Laskar
1993 J jnl
Irredundancy in Circular Arc Graphs.
Discret. Appl. Math.
Martin Charles Golumbic, Renu C. Laskar
1993 J jnl
On the edge-integrity of some graphs and their complements.
Discret. Math.
Renu C. Laskar, S. Stueckle, Barry L. Piazza
1990 J jnl
Bibliography on domination in graphs and some basic definitions of domination parameters.
Discret. Math.
Stephen T. Hedetniemi, Renu C. Laskar
1990 J jnl
Introduction.
Discret. Math.
Stephen T. Hedetniemi, Renu C. Laskar
1988 J jnl
Gallai theorems for graphs, hypergraphs, and set systems.
Discret. Math.
Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar
1987 J jnl
On the equality of the grundy and ochromatic numbers of a graph.
J. Graph Theory
Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar
1986 J jnl
A linear algorithm for finding a minimum dominating set in a cactus.
Discret. Appl. Math.
Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff
1984 J jnl
A note on total domination.
Discret. Math.
Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi
1983 J jnl
On powers and centers of chordal graphs.
Discret. Appl. Math.
Renu C. Laskar, Douglas R. Shier
1980 J jnl
Path number of bipartite digraphs.
J. Comb. Theory B
William G. Frye, Renu C. Laskar
1978 J jnl
Finite nets of dimension d.
Discret. Math.
Jean E. Dunbar, Renu C. Laskar
1978 J jnl
On complementary graphs with no isolated vertices.
Discret. Math.
Renu C. Laskar, Bruce Auerbach
1978 J jnl
On domination and independent domination numbers of a graph.
Discret. Math.
Robert B. Allan, Renu C. Laskar
1978 J jnl
Partial Geometry of Dimension Three.
J. Comb. Theory A
Renu C. Laskar, Jean E. Dunbar
1976 J jnl
On decomposition of r-partite graphs into edge-disjoint hamilton circuits.
Discret. Math.
Renu C. Laskar, Bruce Auerbach
1976 J jnl
Some coloring numbers for complete r-partite graphs.
J. Comb. Theory B
Bruce Auerbach, Renu C. Laskar
1975 J jnl
Cubic graphs on twelve vertices and the line graph of a finite affine plane.
Discret. Math.
Arthur Pellerin, Renu C. Laskar