36 results on '"LI, HENGZHE"'
Search Results
2. Nordhaus–Gaddum-Type Results on the Connected Edge Domination Number
3. Damage Identification and Failure Morphological Reconstruction for Engineering Rock Mass
4. Synergy Prediction Model of Information Entropy Based on Zone Safety Degree and Stope Roof Weighting Step Analysis
5. Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System
6. Investigation on Intelligent Early Warning of Rock Burst Disasters Using the PCA-PSO-ELM Model
7. Edge-Disjoint Steiner Trees and Connectors in Graphs
8. The λ4-Connectivity of the Cartesian Product of Trees
9. Evaluation method of surrounding rock stability: Failure approach index theory of strain limit analysis for engineering applications
10. A Machine Learning Method for Engineering Risk Identification of Goaf
11. Energy Transfer and Damage Evolution Process Research of Ore Rock-Filling Body under the Blasting Load
12. Total Rainbow Connection Number of Some Graph Operations
13. The vertex- rainbow connection number of some graph operations
14. The κk-connectivity of line graphs
15. The λ3-connectivity and κ3-connectivity of recursive circulants
16. Steiner tree packing number and tree connectivity
17. On the Steiner 4-Diameter of Graphs
18. Making a dominating set of a graph connected
19. Rainbow connection number and graph operations
20. Graphs with small total rainbow connection number
21. On Tight Bounds for the k-Forcing Number of a Graph
22. The generalized 3-connectivity of graph products
23. Rainbow connection number of graphs with diameter 3
24. Algorithm on rainbow connection for maximal outerplanar graphs
25. Note on the spanning-tree packing number of lexicographic product graphs
26. Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
27. 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
28. Oriented diameter and rainbow connection number of a graph
29. The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree
30. Note on Minimally d-Rainbow Connected Graphs
31. Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
32. Rainbow connection of graphs with diameter 2
33. The generalized 3-connectivity of Cartesian product graphs
34. The (strong) rainbow connection numbers of Cayley graphs on Abelian groups
35. Conditional connectivity of Cayley graphs generated by transposition trees
36. A kind of conditional fault tolerance of -star graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.