The Quark and the Jaguar: Adventures in the Simple and the Complex (W. H. Freeman, New York, 1994). ⋆ Holland, J. H.

Hidden Order: How Adaptation Builds Complexity (Perseus, Cambridge, MA, 1996). ⋆ Waldrop, M. M.

Complexity: The Emerging Science at the Edge of Order and Chaos (Touchstone, New York, 1992).

A more technical read is: • Casti, J. L.

Reality Rules I & II: Picturing the World in Mathematics: The Fundamentals, the Frontier (Wiley-Interscience, New York, 1997). (2) الشبكات

A good introduction to the mathematical theory of graphs (and one that explains Euler’s theorem in detail) is: ⋆⋆ West, D. B.

Introduction to Graph Theory (Prentice-Hall, Upper Saddle River, NJ, 1996).

A more applied approach to the subject, focusing more on algorithms and applications than on theorems, is presented in the following general texts: ⋆⋆ Lynch, N. A.

Distributed Algorithms (Morgan Kauffman, San Francisco, 1997). ⋆⋆ Ahuja, R. K., Magnanti, T. L., and Orlin, J. B.

Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993). •• Nagurney, A.

অজানা পৃষ্ঠা