12 citations · 18 across the 8 of their papers we have counts for
8 papers
Matrix Multiplication with Less Arithmetic Complexity and IO Complexity
Pu Wu, Huiqing Jiang, Zehui Shao +1
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 l…
On a generalization of fractional Langevin equation
Saeed Kosari, Milad Yadollahzadeh, Zehui Shao +1
In this work, we consider a generalization of the nonlinear Langevin equation of fractional orders with boundary value conditions. The existence and uniqueness of solutions are stu…
On the packing coloring of base-3 Sierpiński and graphs
Fei Deng, Zehui Shao, Aleksander Vesel
For a nondecreasing sequence of integers an -packing -coloring of a graph is a mapping from to such that vertices with c…
Outer independent double Roman domination number of graphs
Doost Ali Mojdeh, Babak Samadi, Zehui Shao +1
A double Roman dominating function of a graph is a function having the property that for each vertex with , there exists …
Changing and unchanging 2-rainbow independent domination
Pu Wu, Zehui Shao, Vladimir Samodivkin +3
For a function we denote by the set of vertices to which the value is assigned by , i.e. . If…
The characterization of perfect Roman domination stable trees
Zepeng Li, Zehui Shao, Yongsheng Rao +2
A \emph{perfect Roman dominating function} (PRDF) on a graph is a function satisfying the condition that every vertex for which $f(…
Tree-colorable maximal planar graphs
Enqiang Zhu, Zepeng Li, Zehui Shao +1
A tree-coloring of a maximal planar graph is a proper vertex -coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph is t…
Size of edge-critical uniquely 3-colorable planar graphs
Zepeng Li, Enqiang Zhu, Zehui Shao +1
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. A uniquely -colorable graph $…