#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1986

1991

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts
- Discrete Mathematics
- 1990

The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper we characterize graphs for which b(G) = p − 1 and b(G) = (γ − 1)+̇1. We also introduce the concept of uniform bondage number bu(G) and determine the exact value… (More)

- Michael S. Jacobson, Lael F. Kinch
- Journal of Graph Theory
- 1986

- Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
- Discrete Mathematics
- 1991

- Lael F. Kinch, Jenö Lehel
- Discrete Mathematics
- 1991

- András Gyárfás, Michael S. Jacobson, Lael F. Kinch
- Discrete Mathematics
- 1988

In this paper we investigate the following generalization of transitivity: A digraph D is (m, n )-transitive whenever there is a path of length m from x to y there is a subset of n + I vertices of these m +I vertices which contain a path of length n from x toy. Here we study various properties of (m, n )-transitive digraphs. In particular, (m, I)-transitive… (More)

- ‹
- 1
- ›