Abstract
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 A l 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 \(\displaystyle \frac{3}{2}n^{2}-2n+4\) is given. Some sign pattern matrices with given bases is characterized and some “gaps” in the base set are shown.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Heidelberg (2008)
Brualdi, R.A., Liu, B.: Generalized Exponents of primitive directed graphs. J. of Graph Theory 14, 483–499 (1994)
Dulmage, A.L., Mendelsohn, N.S.: Graphs and matrices. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, ch. 6, pp. 167–227
Kim, K.H.: Boolean Matrix Theory and Applications. Marcel Dekkez, New York (1982)
Li, Z., Hall, F., Eschenbach, C.: On the period and base of a sign pattern matrix. Linear Algebra Appl. 212(213), 101–120 (1994)
Liu, B.: Combinatorical matrix theory, second published. Science Press, Beijing (2005)
Ljubic, J.I.: Estimates of the number of states that arise in the determinization of a nondeterministic autonomous automaton. Dokl. Akad. Nauk SSSR 155, 41–43 (1964); Soviet Math. Dokl., 5, 345–348 (1964)
Miao, Z., Zhang, K.: The local exponent sets of primitive digraphs. Linear Algebra Appl. 307, 15–33 (2000)
Schwarz, S.: On the semigroup of binary relations on a finite set. Czech. Math. J. 20(95), 632–679 (1970)
Wang, L., Miao, Z., Yan, C.: Local bases of primitive nonpowerful signed digraphs. Discrete Mathematics 309, 748–754 (2009)
You, L., Shao, J., Shan, H.: Bounds on the basis of irreducible generalized sign pattern matrices. Linear Algebra Appl. 427, 285–300 (2007)
Yu, G.L., Miao, Z.K., Shu, J.L.: The bases of the primitive, nonpowerful sign patterns with exactly d nonzero diagonal entries (revision is submitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, G., Miao, Z., Shu, J. (2010). Bases of Primitive Nonpowerful Sign Patterns. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)