The following pages link to Yaping Mao (Q274704):
Displayed 50 items.
- (Q2829070) (← links)
- On the generalized (edge-)connectivity of graphs (Q2876013) (← links)
- (Q2906259) (← links)
- Generalized Connectivity of Graphs (Q2991965) (← links)
- A small-world network derived from the deterministic uniform recursive tree by line graph operation (Q2994711) (← links)
- (Q3134338) (← links)
- ON THE MERRIFIELD-SIMMONS INDEX AND HOSOYA INDEX OF TREE-TRIANGLE GRAPHS (Q3459784) (← links)
- Searching for (near) Optimal Codes (Q3467868) (← links)
- Steiner Distance in Product Networks (Q4560261) (← links)
- (Q4566360) (← links)
- (Q4604120) (← links)
- (Q4604133) (← links)
- The Steiner diameter of a graph (Q4613728) (← links)
- (Q4901472) (← links)
- Bounds for the spectral radius and energy of extended adjacency matrix of graphs (Q4959290) (← links)
- Generalized connectivity of some total graphs (Q4959532) (← links)
- (Q4977514) (← links)
- Graphs with large generalized 3-connectivity (Q4982923) (← links)
- Steiner Degree Distance of Two Graph Products (Q5002880) (← links)
- (Q5011051) (← links)
- (Q5012989) (← links)
- (Q5012995) (← links)
- Fractional Matching Preclusion for (<i>n</i>,<i>k</i>)-Star Graphs (Q5087845) (← links)
- (Q5133103) (← links)
- (Q5133269) (← links)
- (Q5156355) (← links)
- (Q5156431) (← links)
- Steiner (revised) Szeged index of graphs (Q5159211) (← links)
- (Q5165198) (← links)
- The generalized 3-connectivity of Lexicographic product graphs (Q5167713) (← links)
- The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products (Q5198005) (← links)
- Fractional matching preclusion for generalized augmented cubes (Q5207842) (← links)
- (Q5241134) (← links)
- (Q5273076) (← links)
- (Q5279093) (← links)
- (Q5367789) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- The strong rainbow vertex-connection of graphs (Q5419848) (← links)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- (Q5741027) (← links)
- Popoviciu type inequalities for determinants (Q5870072) (← links)
- A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427) (← links)
- Gallai-Ramsey numbers involving a rainbow 4-path (Q6045136) (← links)
- (Q6076150) (← links)
- Complete bipartite graphs without small rainbow stars (Q6094708) (← links)
- Size Gallai-Ramsey number (Q6143692) (← links)
- Complete bipartite graphs without small rainbow subgraphs (Q6153477) (← links)
- On the distance-edge-monitoring numbers of graphs (Q6184320) (← links)
- A survey on the generalized connectivity of graphs (Q6234226) (← links)
- Further hardness results on the generalized connectivity of graphs (Q6241384) (← links)