132 results on '"Guo, Shu-Guang"'
Search Results
2. Maxima of the Q-Spectral Radius of C3C4δ≥2 (C3C4δ≥2)-Free Graphs with Given Size and Minimum Degree C3C4δ≥2
3. Some extremal problems on [formula omitted]-spectral radius of graphs with given size
4. Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
5. Ordering Graphs with Given Size by Their Signless Laplacian Spectral Radii
6. Maxima of the Aα-index of graphs with given size and domination number
7. Sharp upper bounds on the [formula omitted]-index of (minimally) 2-connected graphs with given size
8. Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
9. On the multiplicity of the least signless Laplacian eigenvalue of a graph
10. Maxima of the Q(L)-index of (minimally) 2-edge-connected graphs with given size.
11. Some extremal problems on Aα-spectral radius of graphs with given size
12. The Aα-spread of a graph
13. The Sharp Upper Bounds on the AαC4-Spectral Radius of AαC4-Free Graphs and Halin Graphs
14. A lower bound of the least signless Laplacian eigenvalue of a graph
15. The domination number and the least $Q$-eigenvalue
16. The Majorization Theorems of Single-Cone Trees and Single-Cone Unicyclic Graphs
17. Maxima of the Q-Spectral Radius of $$C_3$$ ($$C_4$$)-Free Graphs with Given Size and Minimum Degree $$\delta \ge 2$$
18. On the least Q-eigenvalue of a non-bipartite hamiltonian graph
19. The Quasi-tree Graph with Maximum Laplacian Spread
20. Maxima of the Q(L)-index of (minimally) 2-edge-connected graphs with given size
21. Maxima of the Q-Spectral Radius of C3 (C4)-Free Graphs with Given Size and Minimum Degree δ≥2.
22. On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
23. Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size
24. Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
25. The domination number and the least Q-eigenvalue
26. A lower bound on the least signless Laplacian eigenvalue of a graph
27. The Aα-spectral radius of dense graphs.
28. The Aα-spectral radius of dense graphs
29. The Sharp Upper Bounds on the $$A_{\alpha }$$-Spectral Radius of $$C_4$$-Free Graphs and Halin Graphs
30. ON THE SPECTRAL RADIUS OF BICYCLIC GRAPHS
31. Ordering graphs by their largest (least) Aα-eigenvalues.
32. Ordering graphs by their largest (least) Aα-eigenvalues
33. The Laplacian spectral radius of tricyclic graphs with [formula omitted] vertices and [formula omitted] pendant vertices
34. Restricted sumsets in a finite abelian group
35. Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues
36. Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings.
37. On the spectral radius of bicyclic graphs with n vertices and diameter d
38. The Sharp Upper Bounds on the Aα-Spectral Radius of C4-Free Graphs and Halin Graphs.
39. Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
40. Bounds on the $A_{\alpha}$-spread of a graph
41. The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
42. On bicyclic graphs whose second largest eigenvalue does not exceed 1
43. Prussian blue analogue-derived Ni and Co bimetallic oxide nanoplate arrays block-built from porous and hollow nanocubes for the efficient oxygen evolution reaction
44. The least Q-eigenvalue with fixed domination number
45. The Majorization Theorems of Single-Cone Trees and Single-Cone Unicyclic Graphs
46. Ordering cacti with signless Laplacian spread
47. The Quasi-tree Graph with Maximum Laplacian Spread
48. Hamiltonian graphs of given order and minimum algebraic connectivity
49. Tension band wiring through double-cannulated screws as a new internal fixation method for treatment of olecranon fractures: a randomized comparative study
50. Hamiltonian graphs of given order and minimum algebraic connectivity.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.