Výsledky vyhledávání

Akademický článek

On the maximum ABC index of bipartite graphs without pendent vertices

Autor: Shao Zehui, Wu Pu, Jiang Huiqin, Sheikholeslami S.M., Wang Shaohui

Publikováno v: Open Chemistry, Vol 18, Iss 1, Pp 39-49 (2020)

For a simple graph G, the atom–bond connectivity index (ABC) of G is defined as ABC(G) = ∑uv∈ E(G)d(u)+d(v)−2d(u)d(v), $\sum_{uv\in{}E(G)} \sqrt{\frac{d(u)+d(v)-2}{d(u)d(v)}},$where d(v) denotes the degree of vertex v of G. In this paper, we

Externí odkaz: https://doaj.org/article/a2e0cc9aaae542c7847aac3430162686

Zobrazit plný text záznamu

Akademický článek

The Sanskruti index of trees and unicyclic graphs

Autor: Deng Fei, Jiang Huiqin, Liu Jia-Bao, Poklukar Darja Rupnik, Shao Zehui, Wu Pu, Žerovnik Janez

Publikováno v: Open Chemistry, Vol 17, Iss 1, Pp 448-455 (2019)

The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighb

Externí odkaz: https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40

Zobrazit plný text záznamu

Report

Matrix Multiplication with Less Arithmetic Complexity and IO Complexity

Autor: Wu, Pu, Jiang, Huiqing, Shao, Zehui, Xu, Jin

After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden leading coefficient which are thus impractical. To reduce the leading c

Externí odkaz: http://arxiv.org/abs/2203.16053