Concepedia

Renu Laskar

RL

30

Publications

1.4K

Citations

19

H-Index

1967

Active since

Affiliations

Clemson University(Current)

University of North Carolina at Chapel Hill

Georgia State University

Furman University

Hungarian Academy of Sciences

Renu Laskar is an author at Clemson University specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEducationNetwork AnalysisEngineeringNetwork ScienceMathematical ProgrammingBusinessComputational Complexity

Publications per year

1967–2017

30

Publications

30

On domination and independent domination numbers of a graph

R. B. Allan, Renu Laskar · Discrete Mathematics · 1978 · 209 citations

Graph Minor, Network Science, Graph Theory +8

Restrained domination in graphs

Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi et al. · Discrete Mathematics · 1999 · 157 citations

Mathematical Programming, Graph Minor, Engineering +7

Bibliography on domination in graphs and some basic definitions of domination parameters

Stephen T. Hedetniemi, Renu Laskar · Discrete Mathematics · 1990 · 147 citations

Graph Minor, Domination Parameters, Graph Theory +8

On the Algorithmic Complexity of Total Domination

Renu Laskar, John Pfaff, Sandra M. Hedetniemi et al. · SIAM Journal on Algebraic and Discrete Methods · 1984 · 119 citations

Mathematical Programming, Directed Graph, Computational Complexity Theory +19

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu Laskar · Discrete Applied Mathematics · 1993 · 98 citations

Geometric Graph Theory, Graph Theory, Topological Graph Theory +7

Rows per page

1–5 of 30