๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Exponents of 2-coloring of symmetric digraphs

โœ Scribed by Yanling Shao; Yubin Gao

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
151 KB
Volume
428
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 symmetric digraphs with loops, establish necessary and sufficient conditions for these to be 2-primitive and determine an upper bound on their exponents. We also characterize the 2-colored digraphs that attain the upper bound and the exponent set for this family of digraphs on n vertices.

๐Ÿ“œ SIMILAR VOLUMES

Generalized exponents of primitive symme
Generalized exponents of primitive symmetric digraphs
โœ Richard A. Brualdi; Shao Jia-yu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1014 KB

A strongly connected digraph D of order n is primitive (aperiodic) provided the greatest common divisor of its directed cycle lengths equals 1. For such a digraph there is a minimum integer t, called the exponent of D, such that given any ordered pair of vertices x and y there is a directed walk fro

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

Local exponents of primitive digraphs
Local exponents of primitive digraphs
โœ Jian Shen; Stewart Neufeld ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

A digraph G = (V, E) is primitive i[~ for some positive integer k, there is a u ~ ~; walk of length k for evew pair u, v of vertices of V. The minimum such k is called the exponent of G, denoted exp(G). The local exponent of G at a vertex u ~ V, denoted expc(u), is the least integer k such that ther