Zobrazeno 1 - 10
of 406
pro vyhledávání: '"Shao Zehui"'
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
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 studied by using results of the fixed point theory. Moreover, the previou
Externí odkaz:
http://arxiv.org/abs/2004.03542
For a nondecreasing sequence of integers $S=(s_1, s_2, \ldots)$ an $S$-packing $k$-coloring of a graph $G$ is a mapping from $V(G)$ to $\{1, 2,\ldots,k\}$ such that vertices with color $i$ have pairwise distance greater than $s_i$. By setting $s_i =
Externí odkaz:
http://arxiv.org/abs/1909.08285
Publikováno v:
Bulletin of the Iranian Mathematical Society (2021)
A double Roman dominating function of a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ having the property that for each vertex $v$ with $f(v)=0$, there exists $u\in N(v)$ with $f(u)=3$, or there are $u,w\in N(v)$ with $f(u)=f(w)=2$, and if
Externí odkaz:
http://arxiv.org/abs/1909.01775
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
For a function $f : V(G ) \rightarrow \{0, 1, 2\}$ we denote by $V_i$ the set of vertices to which the value $i$ is assigned by $f$, i.e. $V_i = \{ x \in V (G ) : f(x ) = i \}$. If a function $f: V(G) \rightarrow \{0,1,2\}$ satisfying the condition t
Externí odkaz:
http://arxiv.org/abs/1810.00246
A \emph{perfect Roman dominating function} (PRDF) on a graph $G = (V, E)$ is a function $f : V \rightarrow \{0, 1, 2\}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to exactly one vertex $v$ for which $f(v) = 2$. Th
Externí odkaz:
http://arxiv.org/abs/1806.03164
Publikováno v:
In Discrete Applied Mathematics 15 December 2022 322:74-93
Publikováno v:
In Discrete Applied Mathematics September 2021
Autor:
Zhu Enqiang, Shao Zehui
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 427-439 (2021)
The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by
Externí odkaz:
https://doaj.org/article/2857b67310094d039ffc56bb387f2b92