20 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tongji UniversityCN4 papers
- Fudan UniversityCN3 papers
- Kyushu UniversityJP3 papers
- Shanghai Jiao Tong UniversityCN3 papers
- Yunnan University of Finance And EconomicsCN3 papers
- Hangzhou Normal UniversityCN2 papers
- Hefei UniversityCN2 papers
- Shanghai University of Finance and EconomicsCN2 papers
- Shanghai University of International Business and EconomicsCN2 papers
- Zhejiang Gongshang UniversityCN2 papers
- Centre National de la Recherche ScientifiqueFR1 paper
- Chengdu UniversityCN1 paper
5 papers · 1 filter
The Steiner Wiener index of trees with a given segment sequence
Jie Zhang, Hua Wang, Xiao-Dong Zhang
The Steiner distance of vertices in a set is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets of cardina…
Locating arrays with mixed alphabet sizes
Ce Shi, Hao Jin, Tatsuhiro Tsuchiya
Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault h…
Consecutive Detecting Arrays for Interaction Faults
Ce Shi, Ling Jiang, Aiyuan Tao
The concept of detecting arrays was developed to locate and detect interaction faults arising between the factors in a component-based system during software testing. In this paper…
Equitable Partition Theorem of Tensors and Spectrum of Generalized Power Hypergraphs
Ya-Lei Jin, Jie Zhang, Xiao-Dong Zhang
In this paper, we present an equitable partition theorem of tensors, which gives the relations between -eigenvalues of a tensor and its quotient equitable tensor and extends the…
Power domination in regular claw-free graphs
Changhong Lu, Rui Mao, Bing Wang
In this paper, we first show that the power domination number of a connected -regular claw-free graph on vertices is at most , and the bound is sharp. The sta…