Filter Results:
- Full text PDF available (6)
Publication Year
1988
2016
- This year (0)
- Last 5 years (5)
- Last 10 years (9)
Publication Type
Co-author
Journals and Conferences
Learn More
- Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae
- Discrete Mathematics
- 1997
Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v].… (More)
- Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
- Discrete Mathematics
- 1999
We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G = (V, E) of the form f : V + { 1, 0, l}. Such a fknction is said to be a… (More)
- Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
- Parallel Processing Letters
- 2004
In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors’ states), yet in a finite amount of time the… (More)
- K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
- Australasian J. Combinatorics
- 2004
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V − S is adjacent to at least one vertex in S. Domination in graphs is a well-studied branch of graph… (More)
- Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae
- Discrete Mathematics
- 1995
- Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
- Discrete Mathematics
- 1997
The following inequality chain has been extensively studied in the discrete mathematical literature: i r ~ y ~ i ~ f l ~ F ~IR, where ir and IR denote the lower and upper irredundance numbers of a… (More)
Research experiences are widely available to upper-division computer science students during the academic year and during summer. Co-op and internship opportunities are available to this group as… (More)
- Jean E. Dunbar, Frederick C. Harris, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar
- Discrete Mathematics
- 1995
- Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
- Self-Stabilizing Systems
- 2003
- Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
- Discrete Applied Mathematics
- 2013
A subset S ⊆ V in a graph G = (V,E) is a [1, 2]-set if for every vertex v ∈ V \ S, 1 ≤ |N(v)∩ S| ≤ 2, that is, every vertex v ∈ V \ S is adjacent to at least one but not more than two vertices in S.… (More)