A Note on a Bermond's Conjecture

Danut Marcu

Displaying similar documents to “A Note on a Bermond's Conjecture”

A Note on a Bermond's Conjecture

Danut Marcu (1986)

Publications de l'Institut Mathématique

Similarity:

Some Remarks On The Structure Of Strong K-Transitive Digraphs

César Hernández-Cruz, Juan José Montellano-Ballesteros (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense. Transitive digraphs have been characterized as compositions of complete digraphs on an acyclic transitive digraph. Also, strong 3 and 4-transitive digraphs have been characterized. In this work we analyze the structure of strong k-transitive digraphs having a cycle of length at least...

Digraphs with large exponent.

Kirkland, S., Olesky, D.D., van den Driessche, P. (2000)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Alspach's problem: The case of Hamilton cycles and 5-cycles.

Jordon, Heather (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Vertex-oriented Hamilton cycles in directed graphs.

Plantholt, Michael J., Tipnis, Shailesh K. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Exotic Collatz cycles

John L. Simons (2008)

Acta Arithmetica

Similarity:

The structure of digraphs associated with the congruence $x^{k} \equiv y (mod n)$

Lawrence Somer, Michal Křížek (2011)

Czechoslovak Mathematical Journal

Similarity:

We assign to each pair of positive integers $n$ and $k \geq 2$ a digraph $G (n, k)$ whose set of vertices is $H = {0, 1, \dots, n - 1}$ and for which there is a directed edge from $a \in H$ to $b \in H$ if $a^{k} \equiv b (mod n)$ . We investigate the structure of $G (n, k)$ . In particular, upper bounds are given for the longest cycle in $G (n, k)$ . We find subdigraphs of $G (n, k)$ , called fundamental constituents of $G (n, k)$ , for which all trees attached to cycle vertices are isomorphic.

On $j$ -Pancyclic Graphs

Vasil Jacoš (1975)

Matematický časopis

Similarity:

Interchangeability of relevant cycles in graphs.

Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Disjoint 5-cycles in a graph

Hong Wang (2012)

Discussiones Mathematicae Graph Theory

Similarity:

We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.

Consistent cycles in 1/2-arc-transitive graphs.

Boben, Marko, Miklavic, Stefko, Potocnik, Primoz (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity: