For a graph G, the Randic index R(G) of G is defined by , where d(u) is the degree of a vertex u and the summation runs over all edges uv of G. Let G(k,n) be the set of connected simple graphs of order n with minimum degree k. Bollobás and Erdos once asked for finding the minimum value of the...

A dynamic weight evolution network with preferential attachment is introduced. The network includes two significant characteristics. (i) Topological growth: triggered by newly added node with M links at each time step, each new edge carries an initial weight growing nonlinearly with time. (ii)...

This study examines mode choice behavior for intercity business and personal/recreational trips. It uses multinomial logit and nested logit methods to analyze revealed preference data provided by travelers along the Yong-Tai-Wen multimodal corridor in Zhejiang, China. Income levels are found to...

Motivated by an evolving model of online bipartite networks, we introduce a model of weighted bipartite evolving networks. In this model, there are two disjoint sets of nodes, called user node set and object node set. Edges only exist between two disjoint sets. Edge weights represent the usage...

This paper analyses some problems existing in building of rural community in Jilin Province as follows, the funds for community building are short; the residents show sluggish participation in community; the infrastructure community building is backward; the organizational building of community...