E. J. Cockayne

University of Victoria — Canada

Computer Science · Physical Sciences

26h-index4.3kcitations89works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(70), Limits and Structures in Graph Theory(31), Graph theory and applications(25), Graph Labeling and Dimension Problems(19), Complexity and Algorithms in Graphs(15)

Publications89 total

Broadcasts and domination in trees
Discrete Mathematics·2010· 24 cited
Open irredundance and maximum degree in graphs
Discrete Mathematics·2008· 4 cited
Claw-free graphs are not universal fixers
Discrete Mathematics·2008· 6 cited
Irredundance, secure domination and maximum degree in trees
Discrete Mathematics·2006· 37 cited
Roman domination in graphs
Discrete Mathematics·2003· 542 cited
On i−-ER-critical graphs
Discrete Mathematics·2003· 4 cited
Changing upper irredundance by edge addition
Discrete Mathematics·2003· 3 cited
Ramsey properties of generalised irredundant sets in graphs
Discrete Mathematics·2001· 4 cited
CO‐irredundant Ramsey numbers for graphs
Journal of Graph Theory·2000
A characterization of (γ, <i>i</i> )‐trees
Journal of Graph Theory·2000· 20 cited
On i-minus-Edge-Removal-critical graphs
Electronic Notes in Discrete Mathematics·2000
Extremal graphs for inequalities involving domination parameters
Discrete Mathematics·2000· 56 cited
CO-irredundant Ramsey numbers for graphs
Journal of Graph Theory·2000· 2 cited
Nordhaus–Gaddum results for CO-irredundance in graphs
Discrete Mathematics·2000· 7 cited
Irredundant and perfect neighbourhood sets in trees
Discrete Mathematics·1998· 11 cited
Using maximality and minimality conditions to construct inequality chains
Discrete Mathematics·1997· 11 cited
Irredundance and Maximum Degree in Graphs
Combinatorics Probability Computing·1997· 19 cited
Domination and irredundance in cubic graphs
Discrete Mathematics·1997· 7 cited
Domination and irredundance in the queens' graph
Discrete Mathematics·1997· 17 cited
Minimality and convexity of dominating and related functions in graphs: A unifying theory
1997· 4 cited
page 1 of 5Next →

Frequent Co-authors

Stephen T. Hedetniemi(15), Christina M. Mynhardt(13), Sandra M. Hedetniemi(4), Odile Favaron(3), Z. A. Melzak(3), B. Bollobás(2), Peter J. Slater(2), Peter Lorimer(2), B. Gamble(2), F. Bruce Shepherd(2), Denton Hewgill(2), Bo Yu(2), Richard C. Brewster(2), Gary MacGillivray(2), Robyn M. Dawes(1), Paul Dreyer(1), S. E. Goodman(1), Donald J. Miller(1), Charles Payan(1), Andrew Thomason(1)