Normalized Sombor indices as complexity measures of random graphs
R. Aguilar-Sanchez,
J. A. Mendez-Bermudez,
Jose M. Rodriguez
et al.
Abstract:We perform a detailed computational study of the recently introduced Sombor indices on random graphs. Specifically, we apply Sombor indices on three models of random graphs: Erdös-Rényi graphs, random geometric graphs, and bipartite random graphs. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the graph, scale with the graph average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of … Show more
In this paper, we introduce the multiplicative modified Revan Sombor index of a graph. Also we compute the multiplicative Revan Sombor index, multiplicative modified Revan Sombor index of triangular benzenoids, benzenoid rhombus, benzenoid hourglass and benzenoid systems.
In this paper, we introduce the multiplicative modified Revan Sombor index of a graph. Also we compute the multiplicative Revan Sombor index, multiplicative modified Revan Sombor index of triangular benzenoids, benzenoid rhombus, benzenoid hourglass and benzenoid systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.