Ernest J. Cockayne

Affiliations:
  • University of Victoria, BC, Canada


According to our database1, Ernest J. Cockayne authored at least 70 papers between 1975 and 2011.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Broadcasts and domination in trees.
Discret. Math., 2011

2009
Claw-free graphs are not universal fixers.
Discret. Math., 2009

2008
Open irredundance and maximum degree in graphs.
Discret. Math., 2008

2007
Irredundance, secure domination and maximum degree in trees.
Discret. Math., 2007

2006
A lower bound for the depression of trees.
Australas. J Comb., 2006

2005
Altitude of small complete and complete bipartite graphs.
Australas. J Comb., 2005

2004
Generalised irredundance in graphs: Nordhaus-Gaddum bounds.
Discuss. Math. Graph Theory, 2004

On i<sup>-</sup>-ER-critical graphs.
Discret. Math., 2004

Roman domination in graphs.
Discret. Math., 2004

Total domination in Kr-covered graphs.
Ars Comb., 2004

2003
Vertices contained in all or in no minimum total dominating set of a tree.
Discret. Math., 2003

Changing upper irredundance by edge addition.
Discret. Math., 2003

2001
Ramsey properties of generalised irredundant sets in graphs.
Discret. Math., 2001

Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb., 2001

Properties of Queens graphs and the irredundance number of Q<sub>7</sub>.
Australas. J Comb., 2001

Queens graphs for chessboards on the torus.
Australas. J Comb., 2001

2000
CO-irredundant Ramsey numbers for graphs.
J. Graph Theory, 2000

A characterization of (γ, <i>i</i>)-trees.
J. Graph Theory, 2000

On i-minus-Edge-Removal-critical graphs.
Electron. Notes Discret. Math., 2000

Extremal graphs for inequalities involving domination parameters.
Discret. Math., 2000

Nordhaus-Gaddum results for CO-irredundance in graphs.
Discret. Math., 2000

Irredundance in the Queen's Graph.
Ars Comb., 2000

1999
On 1-dependent ramsey numbers for graphs.
Discuss. Math. Graph Theory, 1999

1998
An inequality chain of domination parameters for trees.
Discuss. Math. Graph Theory, 1998

Irredundant and perfect neighbourhood sets in trees.
Discret. Math., 1998

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.
Australas. J Comb., 1998

1997
Domination and irredundance in cubic graphs.
Discret. Math., 1997

Using maximality and minimality conditions to construct inequality chains.
Discret. Math., 1997

Domination and irredundance in the queens' graph.
Discret. Math., 1997

Irredundance and Maximum Degree in Graphs.
Comb. Probab. Comput., 1997

1996
Domination critical graphs with higher independent domination numbers.
J. Graph Theory, 1996

Universal maximal packing functions of graphs.
Discret. Math., 1996

On a generalization of signed dominating functions of graphs.
Ars Comb., 1996

1995
Total dominating functions in trees: Minimality and convexity.
J. Graph Theory, 1995

A characterisation of universal minimal total dominating functions in trees.
Discret. Math., 1995

On a Nordhaus-Gaddum type problem for independent domination.
Discret. Math., 1995

Properties of minimal dominating functions of graphs.
Ars Comb., 1995

1994
Universal minimal total dominating functions in graphs.
Networks, 1994

Convexity of minimal dominating functions of trees - II.
Discret. Math., 1994

1993
The sequence of upper and lower domination, independence and irredundance numbers of a graph.
Discret. Math., 1993

1992
Improved Computation of Plane Steiner Minimal Trees.
Algorithmica, 1992

1991
The product of the independent domination numbers of a graph and its complement.
Discret. Math., 1991

1990
Chessboard domination problems.
Discret. Math., 1990

On generalised minimal domination parameters for paths.
Discret. Math., 1990

1989
Irredundant ramsey numbers for graphs.
J. Graph Theory, 1989

On the product of upper irredundance numbers of a graph and its complement.
Discret. Math., 1989

1988
On the independent queens covering problem.
Graphs Comb., 1988

Gallai theorems for graphs, hypergraphs, and set systems.
Discret. Math., 1988

1986
On the diagonal queens domination problem.
J. Comb. Theory A, 1986

Exact Computation of Steiner Minimal Trees in the Plane.
Inf. Process. Lett., 1986

Domination parameters for the bishops graph.
Discret. Math., 1986

1985
An upper bound for the <i>k</i>-domination number of a graph.
J. Graph Theory, 1985

1984
Rotation numbers for unions of circuits.
J. Graph Theory, 1984

The irredundance number and maximum degree of a graph.
Discret. Math., 1984

1982
More rotation numbers for complete bipartite graphs.
J. Graph Theory, 1982

Ordered colourings of graphs.
J. Comb. Theory B, 1982

1981
Information Dissemination in Trees.
SIAM J. Comput., 1981

Contributions to the theory of domination, independence and irredundance in graphs.
Discret. Math., 1981

1980
Total domination in graphs.
Networks, 1980

1979
Graph-theoretic parameters concerning domination, independence, and irredundance.
J. Graph Theory, 1979

Matchings and transversals in hypergraphs, domination and independence-in trees.
J. Comb. Theory B, 1979

Linear Algorithms on Recursive Representations of Trees.
J. Comput. Syst. Sci., 1979

An Algorithm for the Most Economic Link Addition in a Tree Communication Network.
Inf. Process. Lett., 1979

On the sum of cardinalities of extremum maximal independent sets.
Discret. Math., 1979

1978
Disjoint cliques in regular graphs of degree seven and eight.
J. Comb. Theory B, 1978

A linear algorithm for disjoint matchings in trees.
Discret. Math., 1978

1977
Towards a theory of domination in graphs.
Networks, 1977

Edge partitions of complete multipartite graphs into equal length circuits.
J. Comb. Theory B, 1977

1976
Disjoint independent dominating sets in graphs.
Discret. Math., 1976

1975
A Linear Algorithm for the Domination Number of a Tree.
Inf. Process. Lett., 1975


  Loading...