#### Filter Results:

#### Publication Year

1993

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. Any digraph can be shown as a p-cycle with p = 1, and bipartite di-graphs are generalized p-cycles with p = 2. A maximally connected digraph is said… (More)

In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete K h graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special diameter 2 graph. The degree of the graph so constructed… (More)

A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. In this work, we mainly show the two following types of conditions in order to find generalized p-cycles with maximum connectivity: 1. For a new given… (More)

- Philip L. Dowd, J. Gómez, J. Jaramillo, N. J. Walkington
- 2015