The following pages link to Eddie Cheng (Q294706):
Displayed 50 items.
- On the Day-Tripathi orientation of the star graphs: connectivity (Q294708) (← links)
- On the conditional diagnosability of matching composition networks (Q300261) (← links)
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees (Q354456) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges (Q396630) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
- Solution to an open problem on 4-ordered Hamiltonian graphs (Q442328) (← links)
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products (Q444435) (← links)
- Diagnosability of Cayley graphs generated by transposition trees with missing edges (Q497146) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- A strong connectivity property of the generalized exchanged hypercube (Q516776) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- Reliability analysis of the cactus-based networks (Q820572) (← links)
- Strong matching preclusion of \((n,k)\)-star graphs (Q906391) (← links)
- Orienting Cayley graphs generated by transposition trees (Q945169) (← links)
- Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861) (← links)
- Strong structural properties of unidirectional star graphs (Q1005236) (← links)
- Conditional matching preclusion sets (Q1006754) (← links)
- Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
- On the surface area of the \((n,k)\)-star graph (Q1040590) (← links)
- Edge-augmentation of hypergraphs (Q1300051) (← links)
- Successive edge-connectivity augmentation problems (Q1300062) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- Wheel inequalities for stable set polytopes (Q1373764) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes (Q1600099) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks (Q1637216) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- A complete classification of which \((n,k)\)-star graphs are Cayley graphs (Q1706438) (← links)
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks (Q1711835) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- Two kinds of generalized connectivity of dual cubes (Q1730252) (← links)
- Proper distance in edge-colored hypercubes (Q1740062) (← links)
- Length two path centered surface areas of the \((n, k)\)-star graph (Q1750617) (← links)
- Time-stamped graphs and their associated influence digraphs (Q1811116) (← links)
- Linearly many faults in dual-cube-like networks (Q1939250) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree (Q2071534) (← links)
- A note on maximum fractional matchings of graphs (Q2075471) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- Characterization of component diagnosability of regular networks (Q2081491) (← links)
- On the extraconnectivity of arrangement graphs (Q2089554) (← links)
- Reliability analysis of the generalized balanced hypercube (Q2110381) (← links)