Ronald D. Dutton

Publication Activity (10 Years)

Years Active: 1981-2019
Publications (10 Years): 2

Top Topics

Hyper Heuristics

Image Indexing And Retrieval

Top Venues

Discuss. Math. Graph Theory

Publications

Ronald D. Dutton, Robert C. Brigham
A new graph coloring scheme. Bull. ICA 86 (2019)
Ronald D. Dutton, Robert C. Brigham
Color Stable Graphs. Bull. ICA 79 (2017)
Ronald D. Dutton, William Klostermeyer
Edge dominating sets and vertex covers. Discuss. Math. Graph Theory 33 (2) (2013)
Ronald D. Dutton
Global Domination and Packing Numbers. Ars Comb. 101 (2011)
Yiu Yu Ho, Ronald D. Dutton
Global secure sets of grid-like graphs. Discret. Appl. Math. 159 (6) (2011)
Ronald D. Dutton, Robert C. Brigham
On global domination critical graphs. Discret. Math. 309 (19) (2009)
Ronald D. Dutton
On a graph's security number. Discret. Math. 309 (13) (2009)
Khurram Shafique, Ronald D. Dutton
Partitioning a graph into alliance free sets. Discret. Math. 309 (10) (2009)
Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi
Powerful alliances in graphs. Discret. Math. 309 (8) (2009)
Ronald D. Dutton, Robert Lee, Robert C. Brigham
Bounds on a graph's security number. Discret. Appl. Math. 156 (5) (2008)
Robert C. Brigham, Ronald D. Dutton
Bounds on Powerful Alliance Numbers. Ars Comb. 88 (2008)
Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
Security in graphs. Discret. Appl. Math. 155 (13) (2007)
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
On the dimension of trees. Discret. Math. 294 (3) (2005)
Ronald D. Dutton, Robert C. Brigham, Chao Gui
Edge-recognizable domination numbers. Discret. Math. 272 (1) (2003)
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
Full domination in graphs. Discuss. Math. Graph Theory 21 (1) (2001)
Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray
An extremal bandwidth problem for bipartite graphs. J. Graph Theory 35 (4) (2000)
Mary M. Miller, Robert C. Brigham, Ronald D. Dutton
An Equation Involving the Neighborhood (Two-Step) and Line Graphs. Ars Comb. 52 (1999)
Ronald D. Dutton
Inversions in k-sorted Permutations. Discret. Appl. Math. 87 (1-3) (1998)
Ronald D. Dutton, Robert C. Brigham
On the radius and diameter of the clique graph. Discret. Math. 147 (1-3) (1995)
Ronald D. Dutton
Weak-Heap Sort. BIT 33 (3) (1993)
Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton
Edges. Discret. Appl. Math. 44 (1-3) (1993)
Robert C. Brigham, Ronald D. Dutton
A compilation of relations between graph invariants - supplement I. Networks 21 (4) (1991)
Ronald D. Dutton, Robert C. Brigham
Edges in graphs with large girth. Graphs Comb. 7 (4) (1991)
Robert C. Brigham, Ronald D. Dutton
Factor domination in graphs. Discret. Math. 86 (1-3) (1990)
Ronald D. Dutton, Robert C. Brigham
On the size of graphs of a given bandwidth. Discret. Math. 76 (3) (1989)
Ronald D. Dutton, Robert C. Brigham, Fernando Gomez
INGRID: A Graph Invariant Manipulator. J. Symb. Comput. 7 (2) (1989)
Ronald D. Dutton, Robert C. Brigham
An extremal problem for edge domination insensitive graphs. Discret. Appl. Math. 20 (2) (1988)
Robert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton
Vertex domination-critical graphs. Networks 18 (3) (1988)
A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham
Extension of a clique cover result to uniform hypergraphs. Discret. Math. 59 (1-2) (1986)
Ronald D. Dutton, Robert C. Brigham
Computationally Efficient Bounds for the Catalan Numbers. Eur. J. Comb. 7 (3) (1986)
Robert C. Brigham, Ronald D. Dutton
A compilation of relations between graph invariants. Networks 15 (1) (1985)
Robert C. Brigham, Ronald D. Dutton
Bounds on graph spectra. J. Comb. Theory, Ser. B 37 (3) (1984)
Robert C. Brigham, Ronald D. Dutton
Upper bounds on the edge clique cover number of a graph. Discret. Math. 52 (1) (1984)
Ronald D. Dutton, Robert C. Brigham
Efficiently identifying the faces of a solid. Comput. Graph. 7 (2) (1983)
Robert C. Brigham, Ronald D. Dutton
On clique covers and independence numbers of graphs. Discret. Math. 44 (2) (1983)
Ronald D. Dutton, Robert C. Brigham
A characterization of competition graphs. Discret. Appl. Math. 6 (3) (1983)
Robert C. Brigham, Ronald D. Dutton
-tuple colorings of cycles and other graphs. J. Comb. Theory, Ser. B 32 (1) (1982)
Ronald D. Dutton, Robert C. Brigham
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. Theor. Comput. Sci. 17 (1982)
Ronald D. Dutton, Robert C. Brigham
A New Graph Colouring Algorithm. Comput. J. 24 (1) (1981)
Robert C. Brigham, Ronald D. Dutton, James R. Driscoll
Complexity of a proposed database storage structure. Inf. Syst. 6 (1) (1981)
Robert C. Brigham, Ronald D. Dutton
Graphs which, with their complements, have certain clique covering numbers. Discret. Math. 34 (1) (1981)