Yongtang Shi

TL;DR: The general Randic index Rα(G) of a (chemical) graph G, defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d denotes the degree of a vertex u in G and α an arbitrary real number, was proposed by Milan Randic in 1975.

TL;DR: A novel classification scheme is introduced by distinguishing between methods for deterministic and random graphs for a better understanding of the methods, their challenges and, finally, for applying the methods efficiently in an interdisciplinary setting of data science to solve a particular problem involving comparative network analysis.

TL;DR: This survey attempts to bring together most of the results and papers that dealt with the concept of rainbow connection, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.

TL;DR: This paper investigates the interaction between the disease transmission and disease-related awareness spread, and proposes a new coupled disease spreading model on a two-layered multiplex network, where one layer denotes the underlying topology for the epidemics and the other one represents the corresponding topologies for the awareness spread.

TL;DR: The main contribution of this paper is to prove some extremal values for the underlying graph entropy of certain families of graphs and to find the connection between the graph entropy and the sum of degree powers.