- Full text PDF available (9)
- This year (2)
- Last 5 years (22)
- Last 10 years (31)
Journals and Conferences
Let G be a simple connected graph on n vertices and λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G) = n i=1 e λi . Let Tn be the class… (More)
Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. In this paper, the graphs in B(n, g) with the largest signless Laplacian spectral radius are characterized.
For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we… (More)
In wireless networks, it is still a challenge to allocate the limited resources among users to meet their specific quality of service (QoS) requirements, especially when the users have different… (More)
Optimization theory and nonlinear programming method have successfully been applied into wire-lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control… (More)
The resource (bandwidth) allocation in a network is usually casted into a so-called network utility maximization (NUM) problem, which solution strategy has successfully generated distributed… (More)
This paper studies the utility-maximization resource allocation problem for soft QoS traffic in wireless networks, which demands certain amount of bandwidth for normal operation but allows some… (More)
Let Tn be the class of tricyclic graphs on n vertices. In this paper, a sharp lower bound for the total number of matchings of graphs in Tn is determined.
For a graph G, the Merrifield-Simmons index i(G) and the Hosoya index z(G) are defined as the total number of independent sets and the total number of matchings of the graph G, respectively. In this… (More)