John Frederick Fink

According to our database, John Frederick Fink authored at least 10 papers between 1981 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2012

A Generating Function Approach to Network Analysis.

Bruce S. Elenbogen, John Frederick Fink

Int. J. Comput. Their Appl., 2012

2007

Distance distributions for graphs modeling computer networks.

Bruce S. Elenbogen, John Frederick Fink

Discret. Appl. Math., 2007

2002

Remarks on Distance Distributions for Graphs Modeling Computer Networks.

Bruce S. Elenbogen, John Frederick Fink

Electron. Notes Discret. Math., 2002

Convexity in oriented graphs.

Gary Chartrand, John Frederick Fink, Ping Zhang

Discret. Appl. Math., 2002

1994

On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees.

John Frederick Fink

J. Comb. Theory B, 1994

1990

On the decomposition of <i>n</i>-cubes into isomorphic trees.

John Frederick Fink

J. Graph Theory, 1990

The bondage number of a graph.

John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts

Discret. Math., 1990

1985

On smallest regular graphs with a given isopart.

John Frederick Fink

J. Graph Theory, 1985

1982

Randomly antitraceable digraphs.

John Frederick Fink

J. Graph Theory, 1982

1981

A note on path-perfect graphs.

John Frederick Fink, H. Joseph Straight

Discret. Math., 1981