Richard J. Nowakowski

Author

Also Known As

05a, Integers Conference 2005 <2005, Carrollton, Ga.>, João P. Neto, Mathematical Sciences Research Institute, Nowakowski, R. J., Nowakowski, R.J., Nowakowski, Richard, Nowakowski, Richard J., Nowakowski, Richard J. (Richard Joseph), Nowakowski, Richard, J

241

Publications

3.1K

Citations

H-Index

Concepts

All Affiliations

Dalhousie University University of Calgary Saint Mary's University University of Lisbon

About

Richard J. Nowakowski is an author at Dalhousie University specializing in graph theory, discrete mathematics, and network analysis.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	904
2	Education	8	8	895
3	Arts	4	4	67
4	Business	4	4	100
5	Language Studies	1	1	18

Richard J. Nowakowski

Publications

Citations

H-Index

Page 1

	Year	Citations
Vertex-to-vertex pursuit in a graph Richard J. Nowakowski, Peter Winkler Discrete Mathematics Mathematical ProgrammingGraph SparsityNetwork ScienceGraph TheoryEngineering	1983	588
A Characterization of Well Covered Graphs of Girth 5 or Greater Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski Journal of Combinatorial Theory Series B Graph MinorWell Covered GraphsGeometric Graph TheoryGraph TheoryTopological Graph Theory	1993	138
Fixed‐edge theorem for graphs with loops Richard J. Nowakowski, Ivan Rival Journal of Graph Theory	1979	89
Associative graph products and their independence, domination and coloring numbers Richard J. Nowakowski, Douglas F. Rall Discussiones Mathematicae Graph Theory Theory Of ComputingGeometric Graph TheoryProduct ⊗Network ScienceGraph Theory	1996	87
On the Location of Roots of Independence Polynomials Jason I. Brown, C.A. Hickman, Richard J. Nowakowski Journal of Algebraic Combinatorics Real Algebraic GeometryIndependence PolynomialsAnalytic Number TheoryOrthogonal Polynomial	2004	86
Roots of Independence Polynomials of Well Covered Graphs Jason I. Brown, Karl Dilcher, Richard J. Nowakowski Journal of Algebraic Combinatorics	2000	83
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski Journal of Graph Theory Geometric Graph TheoryWell‐covered Graph GGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	1994	62
A game of cops and robbers played on products of graphs Stewart Neufeld, Richard J. Nowakowski Discrete Mathematics Network ScienceGraph TheoryEngineeringNon-cooperative Game TheoryCombinatorial Game	1998	59
The smallest graph variety containing all paths Richard J. Nowakowski, Ivan Rival Discrete Mathematics Graph MinorGraph TheoryAlgebraic Graph TheoryTopological Graph TheorySmallest Graph Variety	1983	52
Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">P</mml:mi></mml:math> positions Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Journal of Combinatorial Theory Series A Math XmlnsMi Mathvariant=Mathematical FoundationsComputer ScienceDiscrete Mathematics	2009	46

Page 1