Skip to main content

Bases of Primitive Nonpowerful Sign Patterns

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6508))

  • 774 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

  2. Brualdi, R.A., Liu, B.: Generalized Exponents of primitive directed graphs. J. of Graph Theory 14, 483–499 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dulmage, A.L., Mendelsohn, N.S.: Graphs and matrices. In: Harary, F. (ed.) Graph Theory and Theoretical Physics,  ch. 6, pp. 167–227

    Google Scholar 

  4. Kim, K.H.: Boolean Matrix Theory and Applications. Marcel Dekkez, New York (1982)

    MATH  Google Scholar 

  5. Li, Z., Hall, F., Eschenbach, C.: On the period and base of a sign pattern matrix. Linear Algebra Appl. 212(213), 101–120 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Liu, B.: Combinatorical matrix theory, second published. Science Press, Beijing (2005)

    Google Scholar 

  7. 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)

    MathSciNet  Google Scholar 

  8. Miao, Z., Zhang, K.: The local exponent sets of primitive digraphs. Linear Algebra Appl. 307, 15–33 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schwarz, S.: On the semigroup of binary relations on a finite set. Czech. Math. J. 20(95), 632–679 (1970)

    MathSciNet  MATH  Google Scholar 

  10. Wang, L., Miao, Z., Yan, C.: Local bases of primitive nonpowerful signed digraphs. Discrete Mathematics 309, 748–754 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. You, L., Shao, J., Shan, H.: Bounds on the basis of irreducible generalized sign pattern matrices. Linear Algebra Appl. 427, 285–300 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics