Gerd Fricke

According to our database1, Gerd Fricke authored at least 14 papers between 1990 and 2011.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
γ-graphs of graphs.
Discuss. Math. Graph Theory, 2011

2004
Offensive alliances in graphs.
Discuss. Math. Graph Theory, 2004

2003
Irredundance and domination in kings graphs.
Discret. Math., 2003

1999
On perfect neighborhood sets in graphs.
Discret. Math., 1999

1998
Independence and Irredundance in k-Regular Graphs.
Ars Comb., 1998

1996
An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discret. Appl. Math., 1996

Maximal Irredundant Functions.
Discret. Appl. Math., 1996

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

Distance independence domination in graphs.
Ars Comb., 1995

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

1994
The Private Neighbor Cube.
SIAM J. Discret. Math., 1994

Representations of graphs modulo <i>n</i>.
J. Graph Theory, 1994

Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance.
Discret. Appl. Math., 1994

1990
On the computational complexity of upper fractional domination.
Discret. Appl. Math., 1990


  Loading...