Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Bravo, Diego, Rada, Juan (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Yan Ling Shao, Yubin Gao (2009)
Czechoslovak Mathematical Journal
Similarity:
We consider the primitive two-colored digraphs whose uncolored digraph has vertices and consists of one -cycle and one -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.
Hajo Broersma, Xueliang Li (2002)
Discussiones Mathematicae Graph Theory
Similarity:
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability....
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Pavel Komárek (1986)
Časopis pro pěstování matematiky
Similarity:
Hortensia Galeana-Sánchez, R. Rojas-Monroy, B. Zavala (2009)
Discussiones Mathematicae Graph Theory
Similarity:
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices of N there is no monochromatic path between them and for every vertex v ∉ N there is a monochromatic path from v to N. We denote by A⁺(u) the set of arcs of D that have u as the initial vertex. We prove that if D is an m-coloured...