Renu C. Laskar

Publication Activity (10 Years)

Years Active: 1975-2020
Publications (10 Years): 2

Top Topics

Parameter Selection

Graph Theoretic

Graph Isomorphism

Neighborhood Graph

Top Venues

Discuss. Math. Graph Theory

Australas. J Comb.

AKCE Int. J. Graphs Comb.

Publications

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