Skip to main content
SpringerLink
Log in

Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs

  • Technical Note
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we study the chaotic numbers of complete bipartite graphs and complete tripartite graphs. For the complete bipartite graphs, we find closed-form formulas of the chaotic numbers and characterize all chaotic mappings. For the complete tripartite graphs, we develop an algorithm running in O(n 4 3) time to find the chaotic numbers, with n 3 the number of vertices in the largest partite set.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chartrand, G., Gavlas, H., and Vanderjagt, D. W., Near Automorphisms of Graph, Graph Theory, Combinatorics, and Applications, Edited by Y. Alavi, D. Lick, and A. J. Schwenk, New Issues Press, Kalamazoo, Michigan, Vol. 1, pp. 181–192, 1999.

    MathSciNet  Google Scholar 

  2. Aitken, W., Total Relative Displacement of Permutations, Journal of Combinatorial Theory, Vol. 87A, pp. 1–21, 1999.

    Article  MathSciNet  Google Scholar 

  3. Chang, C. F., Chen, B. L., and Fu, H. L., Near Automorphisms of Cycles, Preprint, National Chiao Tung University, Hsienchu, Taiwan, 2006.

    Google Scholar 

  4. Chiang, N. P., and Tzeng, C. K., An Upper Bound for the Total Relative Displacements, Preprint, Tatung University, Taipei, Taiwan, 2006.

    Google Scholar 

  5. Reid, K. B., Total Relative Displacement of Vertex Permutations of Kn1, n2, ⋖, nt, Journal of Graph Theory, Vol. 41, pp. 85–100, 2002.

    Article  MathSciNet  Google Scholar 

  6. Fu, H. L., Shiue, C. L., Cheng, X., Du, D. Z., and Kim, J. M., Quadratic Programming with Application in Chaotic Mappings of Complete Multipartite Graphs, Journal of Optimization Theory and Applications, Vol. 110, pp. 545–556, 2001.

    Article  MathSciNet  Google Scholar 

  7. Hwang, F. K., Extremal Permutation with Respect to Weak Majorizations, European Journal of Combinatorics, Vol. 17, pp. 637–645, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Tatung University, Taipei, Taiwan

    N. P. Chiang (Professor)

Authors
  1. N. P. Chiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by P. M. Pardalos

Research supported by NSC 90-2115-M-036-003.

The author thanks the authors of Ref. 6, since his work was motivated by their work. Also, the author thanks the referees for helpful comments which made the paper more readable.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiang, N.P. Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs. J Optim Theory Appl 131, 485–491 (2006). https://doi.org/10.1007/s10957-006-9152-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-006-9152-2

Keywords

Search

Navigation