The following pages link to Yaping Mao (Q274704):
Displayed 50 items.
- The Steiner Wiener index of a graph (Q274705) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- On extremal graphs with internally disjoint Steiner trees (Q400783) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs (Q505439) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Note on matching preclusion number of random graphs (Q784472) (← links)
- Inequalities for the Heinz mean of sector matrices (Q826590) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Inverse problem on the Steiner Wiener index (Q1692631) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Conflict-free connection numbers of line graphs (Q1699775) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- A result on the 3-generalized connectivity of a graph and its line graph (Q1714044) (← links)
- Proper connection number of graph products (Q1714046) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Steiner diameter, maximum degree and size of a graph (Q2032893) (← 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)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings (Q2084984) (← links)
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars (Q2104951) (← links)
- Ramsey and Gallai-Ramsey number for wheels (Q2115156) (← links)
- On relations between Sombor and other degree-based indices (Q2143785) (← links)
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels (Q2166308) (← links)
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges (Q2197415) (← links)
- A note on the strong matching preclusion problem for data center networks (Q2203600) (← links)
- Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph (Q2227113) (← links)
- On cycles that alternate through selected sets of vertices (Q2227991) (← links)
- Gallai-Ramsey numbers for books (Q2274089) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- On the \(g\)-good-neighbor connectivity of graphs (Q2283037) (← links)
- Fractional matching preclusion for arrangement graphs (Q2334054) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- Note on the spanning-tree packing number of lexicographic product graphs (Q2514151) (← links)
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs (Q2657090) (← links)
- Gallai-Ramsey number for the union of stars (Q2674387) (← links)
- Gallai-Ramsey numbers for fans (Q2689508) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- On the equitable vertex arboricity of complete tripartite graphs (Q2788734) (← links)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- The minimal size of a graph with given generalized 3-edge-connectivity (Q2804745) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- (Q2824017) (← links)