198 citations
- Lanzhou UniversityCN37 papers
- Institute of Theoretical PhysicsCN14 papers
- Nankai UniversityCN13 papers
- Institute of Modern PhysicsCN11 papers
- Ludong UniversityCN6 papers
- Oakland UniversityUS5 papers
- Beijing Normal UniversityCN4 papers
- China Jiliang UniversityCN4 papers
- Qinghai UniversityCN4 papers
- Georgia Southern UniversityUS3 papers
- Northwest Normal UniversityCN3 papers
- Chinese Academy of SciencesCN2 papers
32 papers · 1 filter
Constructing disjoint Steiner trees in Sierpiński graphs
Chenxu Yang, Ping Li, Yaping Mao +2
Let be a graph and with . Then the trees in are \emph{internally disjoint Steiner trees} connecting (or -Stei…
Constructing edge-disjoint Steiner trees in Cartesian product networks
Rui Li, Gregory Gutin, He Zhang +3
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. Fo…
Fractional strong matching preclusion for Cartesian product graphs
Bo Zhu, Tianlong Ma
The strong matching preclusion number of a graph, introduced by Park and Ihm in 2011, is the minimum number of vertices and edges whose deletion results in a graph that has neither…
Uniformly most reliable three-terminal graph of dense graphs
Sun Xie, Haixing Zhao, Jun Yin
A graph with specified target vertices in vertex set is a -terminal graph. The -terminal reliability is the connection probability of the fixed target vertices in…
On the -good-neighbor connectivity of graphs
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1
Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network . In 1996, Fàbrega and Fiol proposed the -good-neighbor conn…
Fractional matching preclusion for generalized augmented cubes
Tianlong Ma, Yaping Mao, Eddie Cheng +1
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A…