Zobrazeno 1 - 10
of 143
pro vyhledávání: '"Lü, Huazhong"'
Autor:
Liu, Yasong, Lü, Huazhong
A graph $G$ $=$ $(V,E)$ is vertex-pancyclic if for every vertex $u$ and any integer $l$ ranging from $3$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. A bipartite graph $G$ $=$ $(V,E)$ is vertex-bipancyclic if for every ve
Externí odkaz:
http://arxiv.org/abs/2409.14015
Autor:
Lan, Ting, Lü, Huazhong
The balanced hypercube $BH_{n}$, a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most $4n-5$ faulty edges if each vertex is inc
Externí odkaz:
http://arxiv.org/abs/2208.08601
Autor:
Lü, Huazhong, Deng, Kai
Li et al. in [Inf. Process. Lett. 77 (2001) 35--41] proposed the shuffle cube $SQ_{n}$ as an attractive interconnection network topology for massive parallel and distributed systems. By far, symmetric properties of the shuffle cube remains unknown. I
Externí odkaz:
http://arxiv.org/abs/2110.13645
Autor:
Lü, Huazhong, Wu, Tingzeng
The connectivity of a graph is an important parameter to measure its reliability. Structure and substructure connectivity, component connectivity and $k$-restricted connectivity are well-known generalizations of the concept of connectivity, which hav
Externí odkaz:
http://arxiv.org/abs/2110.05917
The forcing number of a perfect matching $M$ in a graph $G$ is the smallest number of edges inside $M$ that can not be contained in other perfect matchings. The anti-forcing number of $M$ is the smallest number of edges outside $M$ whose removal resu
Externí odkaz:
http://arxiv.org/abs/2012.12898
Autor:
Lü, Huazhong, Wu, Tingzeng
The balanced hypercube $BH_n$, a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2,\cdots,s_{2n-2}\}$ and $T=\{t_1,t_2,\cdots,t_{2n-2}\}$ are any two s
Externí odkaz:
http://arxiv.org/abs/1912.05443
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.
Autor:
Lü, Huazhong, Wu, Tingzeng
Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the $n$-dimensional folded hypercube $FQ_n$ by deleting any perfect matching is isomorphic to the hypercube $Q_n$. In this paper, we show that the conjec
Externí odkaz:
http://arxiv.org/abs/1905.04528
Autor:
Lü, Huazhong, Wu, Tingzeng
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with
Externí odkaz:
http://arxiv.org/abs/1905.04631
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.