3 citations · 6 across the 6 of their papers we have counts for
6 papers
On maximizing private neighbors in graphs
Stephen T. Hedetniemi, Douglas F. Rall
Given a set of vertices in a graph , a {\it private neighbor with respect to the set } is any vertex having precisely one neighbor, say ,…
Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets
Barton F. Cone, Stephen T. Hedetniemi, Lance C. Ingle +1
Sensor networks, such as ultra-wideband sensors for the smart warehouse, may need to run distributed algorithms for automatically determining a topological layout. In this paper, w…
-Matchings in Graphs: A Brief Survey with Some Open Problems
Todd Fenstermacher, Soumendra Ganguly, Stephen Hedetniemi +1
For a graph a matching is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed…
Partial Domination in Graphs
Benjamin M. Case, Stephen T. Hedetniemi, Renu C. Laskar +1
A set is a dominating set of if every vertex in is adjacent to at least one vertex in . The domination number of equals the minimum cardina…
Split Domination, Independence, and Irredundance in Graphs
Stephen Hedetniemi, Fiona Knoll, Renu Laskar
In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set of vertices in a graph is called {\em split dominating}…
Edge Cut Domination, Irredundance, and Independence in Graphs
Todd Fenstermacher, Stephen Hedetniemi, Renu Laskar
An edge dominating set of a graph is an \textit{edge cut dominating set} if the subgraph is disconnected. The \textit{edge cut domination numb…