The following pages link to Weihua Yang (Q275754):
Displaying 50 items.
- On the \(t/k\)-diagnosability of BC networks (Q275756) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Hamiltonian cycles in spanning subgraphs of line graphs (Q298990) (← links)
- Strongly self-centered orientation of complete \(k\)-partite graphs (Q401152) (← links)
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs (Q409406) (← links)
- On a kind of reliability analysis of networks (Q425460) (← links)
- Distance spectral radius of digraphs with given connectivity (Q427824) (← links)
- Super restricted edge connectivity of regular graphs with two orbits (Q428056) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- A note on collapsible graphs and super-Eulerian graphs (Q442301) (← links)
- Collapsible graphs and Hamiltonian connectedness of line graphs (Q444449) (← links)
- Generalized measures of fault tolerance in hypercube networks (Q452923) (← links)
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees (Q456645) (← links)
- Analysis of coupled reaction-diffusion equations for RNA interactions (Q486551) (← links)
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity (Q506323) (← links)
- Outerplanarity of line graphs and iterated line graphs (Q533483) (← links)
- Hamiltonicity of 3-connected line graphs (Q712614) (← links)
- On reliability of the folded hypercubes in terms of the extra edge-connectivity (Q726366) (← links)
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs (Q726495) (← links)
- On the extra edge-connectivity of hypercubes (Q729675) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- How to contract a vertex transitive 5-connected graph (Q782134) (← links)
- Positive solutions to a Neumann problem of semilinear elliptic system with critical nonlinearity (Q861423) (← links)
- Extraconnectivity of hypercubes (Q1023074) (← links)
- Embedding connected double-loop networks with even cardinality in books (Q1033043) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- A kind of conditional fault tolerance of alternating group graphs (Q1675778) (← links)
- A kind of conditional fault tolerance of \((n, k)\)-star graphs (Q1675782) (← links)
- Conditional connectivity of Cayley graphs generated by transposition trees (Q1675816) (← links)
- A kind of conditional connectivity of transposition networks generated by \(k\)-trees (Q1701105) (← links)
- On the spanning connectivity of tournaments (Q1706139) (← links)
- The Turán number for spanning linear forests (Q1720343) (← links)
- Conditional connectivity of folded hypercubes (Q1730267) (← links)
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults (Q1734306) (← links)
- The generalized 3-connectivity of graph products (Q1734731) (← links)
- Every 3-connected essentially 10-connected line graph is Hamilton-connected (Q1759410) (← links)
- Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs (Q1761577) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor (Q2087665) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- On generalized Turán number of two disjoint cliques (Q2154554) (← links)
- Learning to compute the metric dimension of graphs (Q2161840) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs (Q2208247) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- On the edge-connectivity of graphs with two orbits of the same size (Q2275399) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- Anti-\(k\)-labeling of graphs (Q2286097) (← links)
