Renu C. Laskar

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On α-Domination in Graphs.
Graphs and Combinatorics, 2018

2013
Path-neigborhood graphs.
Discussiones Mathematicae Graph Theory, 2013

2012
Minimal rankings of the Cartesian product Kn\Box Km.
Discussiones Mathematicae Graph Theory, 2012

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.
Australasian J. Combinatorics, 2012

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

Fall colouring of bipartite graphs and cartesian products of graphs.
Discrete Applied Mathematics, 2009

2006
Simultaneous graph parameters: Factor domination and factor total domination.
Discrete Mathematics, 2006

t-partitions and s-complete t-partitions of a graph.
Australasian J. Combinatorics, 2006

2005
An algorithm for partial Grundy number on trees.
Discrete Mathematics, 2005

Generalized subgraph-restricted matchings in graphs.
Discrete Mathematics, 2005

2004
Offensive alliances in graphs.
Discussiones Mathematicae Graph Theory, 2004

On 3-simplicial vertices in planar graphs.
Discussiones Mathematicae Graph Theory, 2004

2003
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs.
Electronic Notes in Discrete Mathematics, 2003

On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discrete Mathematics, 2003

Factor domination and minimum degree.
Discrete Mathematics, 2003

2000
alpha-Domination.
Discrete Mathematics, 2000

1999
Restrained domination in graphs.
Discrete Mathematics, 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 gammaf for some graphs.
Discrete Mathematics, 1997

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

Minimal rankings.
Networks, 1996

1995
Nearly perfect sets in graphs.
Discrete Mathematics, 1995

1994
Periodic gossiping on trees.
Discrete Applied Mathematics, 1994

1993
On the edge-integrity of some graphs and their complements.
Discrete Mathematics, 1993

Introduction.
Discrete Applied Mathematics, 1993

Irredundancy in Circular Arc Graphs.
Discrete Applied Mathematics, 1993

1990
Bibliography on domination in graphs and some basic definitions of domination parameters.
Discrete Mathematics, 1990

Introduction.
Discrete Mathematics, 1990

1988
Gallai theorems for graphs, hypergraphs, and set systems.
Discrete Mathematics, 1988

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

1986
A linear algorithm for finding a minimum dominating set in a cactus.
Discrete Applied Mathematics, 1986

1984
A note on total domination.
Discrete Mathematics, 1984

1983
On powers and centers of chordal graphs.
Discrete Applied Mathematics, 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.
Discrete Mathematics, 1978

Finite nets of dimension d.
Discrete Mathematics, 1978

On domination and independent domination numbers of a graph.
Discrete Mathematics, 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.
Discrete Mathematics, 1976

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


  Loading...