3 citations · 17 across the 31 of their papers we have counts for
5 papers · 1 filter
On traceable iterated line graph and hamiltonian path index
Zhaohong Nou, Liming Xiong, Weihua Yang
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs for which the -th iterated lin…
A Stability Theorem for Maximal -free Graphs
Jian Wang, Shipeng Wang, Weihua Yang +1
For any positive integer , we show that every maximal -free graph with at least edges contains an induced complete bipartite subgraph on …
The -extra edge-connectivity of balanced hypercubes
Yulong Wei, Rong-hua Li, Weihua Yang
The -extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464--473] determined…
Hybrid fault diagnosis capability analysis of highly connected graphs
Yulong Wei, Rong-hua Li, Weihua Yang
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the -edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty…
Scaling Up Distance-generalized Core Decomposition
Qiangqiang Dai, Rong-Hua Li, Lu Qin +4
Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-…