For a graph G, the resistance distance is defined to be the effective resistance between vertices x and y, the multiplicative degree-Kirchhoff index , where is the degree of vertex x, and denotes the vertex set of G. L. Feng et al. obtained the element in with first-minimum multiplicative degree-Kirchhoff index. In this paper, we first give some transformations on , and then, by these transformations, the second-minimum multiplicative degree-Kirchhoff index and the corresponding extremal graph are determined, respectively.
6 June 2019 in Bulletin of the Iranian Mathematical Society
In the actual network the information collected through routing protocols is uncertain with the expansion of network size and complexity. In this paper, the QOS routing problem is investigated in the networks environment with uncertain parameters. The fuzzy set theory is used to define the relationship between two fuzzy numbers, and construct a QOS routing model of multi-objective optimization. A multi-objective evolutionary algorithm (MOEA) is utilized to solve the problem. Simulation shows the MOEA can provide an available approach to QoS routing in networks environment with uncertain parameters.
20 October 2017 in Journal of Applied Mathematics and Computing