#### Filter Results:

- Full text PDF available (64)

#### Publication Year

1980

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, J Scott 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â€¦ (More)

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
- J. Comb. Theory, Ser. B
- 1989

We investigate the relationship between the cardinality of the union of the neighborhoods of an arbitrary pair of nonadjacent vertices and various hamiltonian type properties in graphs. Inâ€¦ (More)

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
- Graphs and Combinatorics
- 2004

Given positive integers k m n, a graphG of order n is Ã°k;mÃž-pancyclic if for any set of k vertices of G and any integer r with m r n, there is a cycle of length r containing the k vertices. Minimumâ€¦ (More)

- Frank Harary, Michael S. Jacobson
- Discussiones Mathematicae Graph Theory
- 2001

Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find thatâ€¦ (More)

- Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid
- Journal of Graph Theory
- 2006

A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e. a hamiltonian path. Given a tournament T , it is well known that itâ€¦ (More)

- Ronald J. Gould, Michael S. Jacobson
- Discrete Mathematics
- 1982

We consider only finite undirected graphs without loops or multiple edges. Notation or terms not defined here can be found in [1]. Let G be a graph and let S Â£; V( G). The subgraph (S) induced by Sâ€¦ (More)

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

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
- Discrete Mathematics
- 2005

In this talk, we consider a minimum degree condition for a hamiltonian graph to have a 2-factor with two components. Let G be a graph of order n â‰¥ 3. Diracâ€™s theorem says that if the minimum degreeâ€¦ (More)

- Michael S. Jacobson, JenÃ¶ Lehel, Linda M. Lesniak
- Discrete Applied Mathematics
- 1993

- Michael S. Jacobson, Kenneth Peters
- Discrete Applied Mathematics
- 1993

Jacobson, MS. and K. Peters, A note on graphs which have upper irredundance equal to independence, Discrete Applied Mathematics 44 (1993) 91-97. In this paper we consider the following graphâ€¦ (More)