Renu C. Laskar
#58,099
Most Influential Person Now
Indian-born American mathematician
Renu C. Laskar's AcademicInfluence.com Rankings
Renu C. Laskarmathematics Degrees
Mathematics
#3678
World Rank
#5383
Historical Rank
#1340
USA Rank
Algebraic Geometry
#208
World Rank
#216
Historical Rank
#47
USA Rank
Number Theory
#377
World Rank
#471
Historical Rank
#62
USA Rank
Measure Theory
#3853
World Rank
#4541
Historical Rank
#1099
USA Rank
Download Badge
Mathematics
Renu C. Laskar's Degrees
- Masters Mathematics Stanford University
Why Is Renu C. Laskar Influential?
(Suggest an Edit or Addition)According to Wikipedia, Renu Chakravarti Laskar is an Indian-born American mathematician, specializing in graph theory. She is Professor Emerita of Mathematical sciences at Clemson University. She received her Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign in 1962. Renu Chakravarti Laskar's life was marked by a personal loss when her husband, Amulya L. Laskar, a distinguished professor of physics, died in 1991. His obituary in The New York Times recognized his contributions to physics and his role at the University of Missouri-Columbia.
Renu C. Laskar's Published Works
Published Works
- On domination and independent domination numbers of a graph (1978) (236)
- Bibliography on domination in graphs and some basic definitions of domination parameters (1991) (154)
- Restrained domination in graphs (1999) (144)
- On the Algorithmic Complexity of Total Domination (1984) (105)
- Irredundancy in Circular Arc Graphs (1993) (100)
- On decomposition of r-partite graphs into edge-disjoint hamilton circuits (1976) (93)
- Offensive alliances in graphs (2004) (91)
- On powers and centers of chordal graphs (1983) (70)
- A linear algorithm for finding a minimum dominating set in a cactus (1986) (53)
- On domination related concepts in Graph Theory (1981) (51)
- A note on total domination (1984) (48)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (2003) (41)
- A Characterization of Tetrahedral Graphs (1967) (38)
- Generalized subgraph-restricted matchings in graphs (2005) (37)
- Topics on Domination (2012) (33)
- Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs (1987) (32)
- Broadcasting and Gossiping in Communication Networks (1999) (31)
- On the equality of the grundy and ochromatic numbers of a graph (1987) (30)
- alpha-Domination (2000) (21)
- A characterization of cubic lattice graphs (1967) (20)
- The bondage and reinforcement numbers of gammaf for some graphs (1997) (20)
- Fall colouring of bipartite graphs and cartesian products of graphs (2009) (20)
- Gallai theorems for graphs, hypergraphs, and set systems (1988) (19)
- Eigenvalues of the adjacency matrix of cubic lattice graphs. (1969) (19)
- An algorithm for partial Grundy number on trees (2005) (18)
- On weak domination in graphs (1998) (18)
- Further Results on Minimal Rankings (1999) (17)
- Chromatic Numbers for Certain Graphs (1972) (17)
- Nearly perfect sets in graphs (1995) (16)
- Minimal rankings (1996) (14)
- Periodic gossiping on trees (1994) (12)
- Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs (2011) (12)
- Chessboard graphs, related designs, and domination parameters (1999) (12)
- On the edge-integrity of some graphs and their complements (1993) (10)
- Partial Geometry of Dimension Three (1978) (10)
- Factor domination and minimum degree (2003) (9)
- On $$\alpha $$α-Domination in Graphs (2017) (8)
- Finite nets of dimension three. I (1974) (8)
- Eigenvalues of the adjacency matrix of tetrahedral graphs (1970) (8)
- On complementary graphs with no isolated vertices (1978) (7)
- On irreducible no‐hole L(2, 1)‐coloring of trees (2009) (7)
- On irreducible no-hole L(2, 1)-coloring of trees (2009) (7)
- Finite nets of dimension d (1978) (7)
- A geometric characterization of the line graph of a projective plane (1967) (6)
- Simultaneous graph parameters: Factor domination and factor total domination (2006) (6)
- ON MAXIMUM CHORDAL SUBGRAPH (1983) (6)
- Perfect Domination in Knights Graphs. (2018) (5)
- Partial Domination in Graphs (2017) (5)
- Quorum Colorings of Graphs (2012) (5)
- Holes in L(2,1)-Coloring on Certain Classes of Graphs (2009) (4)
- Cycle Domination, Independence and Irredundance in graphs (2015) (3)
- The Chromatic Polynomial of a Complete r-Partite Graph (1975) (3)
- On 3-simplicial vertices in planar graphs (2004) (2)
- A NOTE ON THE SIZE OF A CHORDAL SIJBGRAPH (1985) (2)
- Some coloring numbers for complete r-partite graphs (1976) (2)
- Path-Neighborhood Graphs (2013) (2)
- Minimal rankings of the Cartesian product Kn\Box Km (2012) (2)
- Path number of bipartite digraphs (1980) (2)
- Different-Distance Sets in a Graph (2019) (2)
- The 2-dimension of a Tree (2020) (1)
- Properties of Partial Dominating Sets of Graphs. (2019) (1)
- Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs (2003) (1)
- Cubic graphs on twelve vertices and the line graph of a finite affine plane (1975) (1)
- On Irredundance, Dimension, and Rank of Posets a (1989) (1)
- MINIMAL RANKINGS OF THE CARTESIAN PRODUCT Kn Km (2012) (1)
- Edge Cut Domination, Irredundance, and Independence in Graphs (2016) (1)
- Gallai Theorems Involving Domination Parameters (2002) (1)
- On α -Domination in Graphs (2017) (0)
- $P$-Matchings in Graphs: A Brief Survey with Some Open Problems (2018) (0)
- Introduction (1990) (0)
- New resolvability parameters of graphs (2020) (0)
- Split Domination, Independence, and Irredundance in Graphs (2016) (0)
- Colourings in Bipartite graphs (2019) (0)
- $\beta$-Packing Sets in Graphs (2019) (0)
- Cyclic gossiping times for some classes of graphs (1996) (0)
- Domination Using Induced Cliques in Graphs (1999) (0)
- Domination Parameters of Rooks and Bishops (2018) (0)
- T-partitions and S-complete T-partitions of a Graph (2006) (0)
This paper list is powered by the following services:
Other Resources About Renu C. Laskar
What Schools Are Affiliated With Renu C. Laskar?
Renu C. Laskar is affiliated with the following schools: