The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Digraphs with large exponent.”

Exponents of two-colored digraphs

Yan Ling Shao, Yubin Gao (2009)

Czechoslovak Mathematical Journal

Similarity:

We consider the primitive two-colored digraphs whose uncolored digraph has n + s vertices and consists of one n -cycle and one ( n - 3 ) -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.

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...

Independent Detour Transversals in 3-Deficient Digraphs

Susan van Aardt, Marietjie Frick, Joy Singleton (2013)

Discussiones Mathematicae Graph Theory

Similarity:

In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour transversal (IDT), i.e. an independent set which intersects every longest path. Havet [Stable set meeting every longest path, Discrete Math. 289 (2004) 169-173] showed that the conjecture holds for digraphs with independence number two. A digraph...