✦ LIBER ✦

Exponents of two-colored digraphs with two cycles

✍ Scribed by Yubin Gao; Yanling Shao

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 216 KB
Volume: 407
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponents of a class of two-colored digr

Exponents of a class of two-colored digraphs with two cycles

✍ Fengying Huang; Bolian Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A two-colored digraph is a digraph whose arcs are colored red or blue. A two-colored digraph is primitive provided that there exist nonnegative integers h and k with h + k > 0 such that for each pair (i, j ) of vertices there is an (h, k)-walk from i to j in D. The exponent of D is the minimum value

Generalized exponents of primitive two-c

Generalized exponents of primitive two-colored digraphs

✍ Yubin Gao; Yanling Shao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Exponents of 2-coloring of symmetric dig

Exponents of 2-coloring of symmetric digraphs

✍ Yanling Shao; Yubin Gao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A 2-coloring (G 1 , G 2 ) of a digraph is 2-primitive if there exist nonnegative integers h and k with h + k > 0 such that for each ordered pair (u, v) of vertices there exists an is the minimum value of h + k taken over all such h and k. In this paper, we consider 2-colorings of strongly connected

Alternating hamiltonian cycles in two co

Alternating hamiltonian cycles in two colored complete bipartite graphs

✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 2 views

## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.

Coloring a graph optimally with two colo

Coloring a graph optimally with two colors

✍ H.J. Broersma; F. Göbel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Let G be a graph with point set V. A (2.)c,oloring of G is a map of V to ired, white!. An error occurs whenever the two endpoints of a line have the same color. An oprimul doring of G is a coloring of G for which the number of errors is minimum. The minimum number of errors is denoted by y(G), we de

Characterizations of two classes of digr

Characterizations of two classes of digraphs

✍ Zygmunt Jackowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 796 KB

In the paper we present two characterizations of classes of digraphs. The first is a forbidden triple characterization of digraphs with augmented adjacency matrices having consecutive ones property for columns. The second is a forbidden circuit characterization of digraphs with totally balanced augm