The SCEAS System
| |||||||

## Search the dblp DataBase
Ronald D. Dutton:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mary M. Miller, Robert C. Brigham, Ronald D. Dutton
**An Equation Involving the Neighborhood (Two-Step) and Line Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:52, n:, pp:- [Journal] - Ronald D. Dutton
**Weak-Heap Sort.**[Citation Graph (0, 0)][DBLP] BIT, 1993, v:33, n:3, pp:372-381 [Journal] - Ronald D. Dutton, Robert C. Brigham
**Efficiently identifying the faces of a solid.**[Citation Graph (0, 0)][DBLP] Computers & Graphics, 1983, v:7, n:2, pp:143-147 [Journal] - Ronald D. Dutton, Robert C. Brigham
**A New Graph Colouring Algorithm.**[Citation Graph (0, 0)][DBLP] Comput. J., 1981, v:24, n:1, pp:85-86 [Journal] - Ronald D. Dutton
**Inversions in k-sorted Permutations.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:49-56 [Journal] - Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton
**Extremal Graphs Domination Insensitive to the Removal of**[Citation Graph (0, 0)][DBLP]*k*Edges. Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:295-304 [Journal] - Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
**On the dimension of trees.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:294, n:3, pp:279-283 [Journal] - Ronald D. Dutton, Robert C. Brigham, Chao Gui
**Edge-recognizable domination numbers.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:1, pp:47-51 [Journal] - Robert C. Brigham, Ronald D. Dutton, James R. Driscoll
**Complexity of a proposed database storage structure.**[Citation Graph (0, 0)][DBLP] Inf. Syst., 1981, v:6, n:1, pp:47-52 [Journal] - Robert C. Brigham, Ronald D. Dutton
**Generalized**[Citation Graph (0, 0)][DBLP]*k*-tuple colorings of cycles and other graphs. J. Comb. Theory, Ser. B, 1982, v:32, n:1, pp:90-94 [Journal] - Robert C. Brigham, Ronald D. Dutton
**Bounds on graph spectra.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:228-234 [Journal] - Ronald D. Dutton, Robert C. Brigham, Fernando Gomez
**INGRID: A Graph Invariant Manipulator.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:7, n:2, pp:163-177 [Journal] - Ronald D. Dutton, Robert C. Brigham
**The Complexity of a Multiprocessor Task Assignment Problem without Deadlines.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:17, n:, pp:213-216 [Journal] - Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
**Security in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:13, pp:1708-1714 [Journal] - Robert C. Brigham, Ronald D. Dutton
**Graphs which, with their complements, have certain clique covering numbers.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:34, n:1, pp:1-7 [Journal] - Robert C. Brigham, Ronald D. Dutton
**On clique covers and independence numbers of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:44, n:2, pp:139-144 [Journal] - Robert C. Brigham, Ronald D. Dutton
**Upper bounds on the edge clique cover number of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:52, n:1, pp:31-37 [Journal] - A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham
**Extension of a clique cover result to uniform hypergraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:59, n:1-2, pp:199-201 [Journal] - Ronald D. Dutton, Robert C. Brigham
**On the size of graphs of a given bandwidth.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:76, n:3, pp:191-195 [Journal] - Robert C. Brigham, Ronald D. Dutton
**Factor domination in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:86, n:1-3, pp:127-136 [Journal] - Ronald D. Dutton, Robert C. Brigham
**On the radius and diameter of the clique graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:147, n:1-3, pp:293-295 [Journal] **Bounds on Powerful Alliance Numbers.**[Citation Graph (, )][DBLP]**Bounds on a graph's security number.**[Citation Graph (, )][DBLP]**An extremal problem for edge domination insensitive graphs.**[Citation Graph (, )][DBLP]**Partitioning a graph into alliance free sets.**[Citation Graph (, )][DBLP]**On global domination critical graphs.**[Citation Graph (, )][DBLP]**On a graph's security number.**[Citation Graph (, )][DBLP]**Powerful alliances in graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |