Renu C. Laskar

Affiliations:
  • Clemson University, Department of Mathematical Sciences


According to our database1, Renu C. Laskar authored at least 44 papers between 1975 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
New resolvability parameters of graphs.
AKCE Int. J. Graphs Comb., 2020

2018
On α-Domination in Graphs.
Graphs Comb., 2018

2013
Path-neigborhood graphs.
Discuss. Math. Graph Theory, 2013

2012
Minimal rankings of the Cartesian product <i>K<sub>n</sub>\Box K<sub>m</sub></i>.
Discuss. Math. Graph Theory, 2012

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.
Australas. J Comb., 2012

2009
On irreducible no-hole <i>L</i>(2, 1)-coloring of trees.
Networks, 2009

Fall colouring of bipartite graphs and cartesian products of graphs.
Discret. Appl. Math., 2009

2006
Simultaneous graph parameters: Factor domination and factor total domination.
Discret. Math., 2006

t-partitions and s-complete t-partitions of a graph.
Australas. J Comb., 2006

2005
An algorithm for partial Grundy number on trees.
Discret. Math., 2005

Generalized subgraph-restricted matchings in graphs.
Discret. Math., 2005

2004
Offensive alliances in graphs.
Discuss. Math. Graph Theory, 2004

On 3-simplicial vertices in planar graphs.
Discuss. Math. Graph Theory, 2004

2003
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs.
Electron. Notes Discret. Math., 2003

On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discret. Math., 2003

Factor domination and minimum degree.
Discret. Math., 2003

2000
alpha-Domination.
Discret. Math., 2000

1999
Restrained domination in graphs.
Discret. Math., 1999

Further Results on Minimal Rankings.
Ars Comb., 1999

Domination Using Induced Cliques in Graphs.
Ars Comb., 1999

1998
On weak domination in graphs.
Ars Comb., 1998

1997
The bondage and reinforcement numbers of gamma<sub>f</sub> for some graphs.
Discret. Math., 1997

1996
Cyclic gossiping times for some classes of graphs.
Networks, 1996

Minimal rankings.
Networks, 1996

1995
Nearly perfect sets in graphs.
Discret. Math., 1995

1994
Periodic gossiping on trees.
Discret. Appl. Math., 1994

1993
On the edge-integrity of some graphs and their complements.
Discret. Math., 1993

Introduction.
Discret. Appl. Math., 1993

Irredundancy in Circular Arc Graphs.
Discret. Appl. Math., 1993

1990
Bibliography on domination in graphs and some basic definitions of domination parameters.
Discret. Math., 1990

Introduction.
Discret. Math., 1990

1988
Gallai theorems for graphs, hypergraphs, and set systems.
Discret. Math., 1988

1987
On the equality of the grundy and ochromatic numbers of a graph.
J. Graph Theory, 1987

1986
A linear algorithm for finding a minimum dominating set in a cactus.
Discret. Appl. Math., 1986

1984
A note on total domination.
Discret. Math., 1984

1983
On powers and centers of chordal graphs.
Discret. Appl. Math., 1983

1980
Path number of bipartite digraphs.
J. Comb. Theory, Ser. B, 1980

1978
Partial Geometry of Dimension Three.
J. Comb. Theory, Ser. A, 1978

On complementary graphs with no isolated vertices.
Discret. Math., 1978

Finite nets of dimension d.
Discret. Math., 1978

On domination and independent domination numbers of a graph.
Discret. Math., 1978

1976
Some coloring numbers for complete r-partite graphs.
J. Comb. Theory, Ser. B, 1976

On decomposition of r-partite graphs into edge-disjoint hamilton circuits.
Discret. Math., 1976

1975
Cubic graphs on twelve vertices and the line graph of a finite affine plane.
Discret. Math., 1975


  Loading...