Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs

N. P. Chiang
Additional contact information
N. P. Chiang: Tatung University

Journal of Optimization Theory and Applications, 2006, vol. 131, issue 3, No 11, 485-491

Abstract: 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.

Keywords: Complete bipartite graphs; complete tripartite graphs; chaotic numbers; chaotic mappings (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-006-9152-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:131:y:2006:i:3:d:10.1007_s10957-006-9152-2

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-006-9152-2

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().