We sketch a subset of Professor F.Y. Wu's contributions in lattice statistical mechanics, solid state physics, graph theory, enumerative combinatorics and other domains of physics and mathematics. We will recall some of F.Y. Wu's most important and well-known classic results and we will also...

The neuronal network of the soil nematode Caenorhabditis elegans (C. elegans), which is a good prototype for biological studies, is investigated. Here, the neuronal network is simplified as a graph. We use three indicators to characterize the graph; vertex degree, generalized eccentricity (GE),...

Protein structures can be studied as complex networks of interacting amino acids. We study proteins of different structural classes from the network perspective. Our results indicate that proteins, regardless of their structural class, show small-world network property. Various network...

In this paper, the stability problem for some coupled systems with time delay on networks (CSDNs) is investigated. We provide a systematic method for constructing a global Lyapunov functional for CSDNs by using graph theory. The stability, uniform stability and global uniform stability of the...

Connectivity plays a crucial role as agencies at the federal and state level focus on expanding the public transit system to meet the demands of a multimodal transportation system. Transit agencies have a need to explore mechanisms to improve connectivity by improving transit service. This...

We use the multiregional core-periphery model of the new economic geography to analyze and compare the agglomeration and dispersion forces shaping the location of economic activity for a continuum of network topologies characterized by their degree of centrality, and comprised between two...

Social sharing of information goods--wherein a single good is purchased and shared through a network of acquaintances such as friends or coworkers--is a significant concern for the providers of these goods. The effect of social sharing on firm pricing and profits depends critically on two...

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R3 of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable...

An alternative perspective to evaluate networks and network evolution is introduced, based on the notion of covering. For a particular node in a network covering captures the idea of being outperformed by another node in terms of, for example, visibility and possibility of information gathering....

Network robustness issues are crucial in a variety of application areas. In many situations, one of the key robustness requirements is the connectivity between each pair of nodes through a path that is short enough, which makes a network cluster more robust with respect to potential network...