28 results on '"Zhai, Mingqing"'
Search Results
2. Extremal problems on planar graphs without k edge-disjoint cycles
3. Outerplanar Turán numbers of cycles and paths
4. Counting substructures and eigenvalues I: Triangles
5. Maxima of the Q-index: Forbidden a fan
6. Spectral extrema of Ks,t-minor free graphs – On a conjecture of M. Tait
7. Signless Laplacian spectral radius of graphs without short cycles or long cycles
8. Planar Turán number of intersecting triangles
9. Maximize the Q-index of graphs with fixed order and size
10. A spectral version of Mantel's theorem
11. Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs
12. Proof of a conjecture on extremal spectral radii of blow-up graphs
13. The signless Laplacian spectral radius of graphs with a prescribed number of edges
14. The spectral Turán problem about graphs with no 6-cycle
15. Spectral conditions for the existence of specified paths and cycles in graphs
16. On graphs with at least three distance eigenvalues less than −1
17. Pebbling number of squares of odd cycles
18. Proof of a conjecture on the spectral radius of [formula omitted]-free graphs
19. Sharp upper bounds on the second largest eigenvalues of connected graphs
20. On the Laplacian spread of graphs
21. The Laplacian spectral radius of bicyclic graphs with a given girth
22. Complete subgraphs in connected graphs and its application to spectral moment
23. On the spectral radius of bipartite graphs with given diameter
24. The minimum spectral radius of graphs with a given independence number
25. Maximizing the spectral radius of bicyclic graphs with fixed girth
26. The least eigenvalue of unicyclic graphs with [formula omitted] vertices and [formula omitted] pendant vertices
27. Maximizing the Laplacian spectral radii of graphs with given diameter
28. Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.