论文信息 - Bases of Primitive Nonpowerful Sign Patterns

Bases of Primitive Nonpowerful Sign Patterns

For a square primitive nonpowerful sign pattern A, the base of A, denoted by l(A), is the least positive integer l such that every entry of Al is #. In this paper, we consider the base set of the primitive nonpowerful sign pattern matrices. Some bounds on the bases for the sign pattern matrices with base at least 3/2n2 - 2n + 4 is given. Some sign pattern matrices with given bases is characterized and some "gaps" in the base set are shown.

Zhengke Miao | Jinlong Shu | Guanglong Yu

[1] Štefan Schwarz. On the semigroup of binary relations on a finite set , 1970 .

[2] Chao Yan,et al. Local bases of primitive non-powerful signed digraphs , 2009, Discret. Math..

[3] Bolian Liu,et al. Generalized exponents of primitive directed graphs , 1990, J. Graph Theory.

[4] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.

[5] Zhengke Miao,et al. The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries , 2011, Discret. Math..

[6] Ki Hang Kim. Boolean matrix theory and applications , 1982 .

[7] Jia-Yu Shao,et al. Bounds on the bases of irreducible generalized sign pattern matrices , 2007 .

[8] Kemin Zhang,et al. The local exponent sets of primitive digraphs , 2000 .

[9] Frank J. Hall,et al. On the period and base of a sign pattern matrix , 1994 .