307 results on '"Meng, Jixiang"'
Search Results
2. Minimizing the least Laplacian eigenvalue of signed complete graphs
3. On spanning laceability of bipartite graphs
4. Fault tolerance assessment for hamming graphs based on r-restricted R-structure(substructure) fault pattern
5. A new condition on dominated pair degree sum for a digraph to be supereulerian
6. Disjoint path covers of star graphs
7. Reliability analyses of regular graphs based on edge-structure connectivity
8. The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
9. On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
10. Some graphs determined by their [formula omitted]-spectra
11. Unbalanced signed bicyclic graphs minimizing the least eigenvalue
12. Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity
13. Antidirected spanning closed trail in tournaments
14. Ore conditions for antistrong digraphs
15. The edge fault-tolerant spanning laceability of the enhanced hypercube networks
16. Antidirected Hamiltonian Paths and Cycles of Digraphs with α2-Stable Number 2
17. On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
18. Degree sequence conditions for a graph to be disjoint path coverable
19. Reliabilities for two kinds of graphs with smaller diameters
20. Component connectivity of the data center network DCell
21. The spanning cyclability of Cayley graphs generated by transposition trees
22. Structure fault-tolerance of divide-and-swap k-ary n-cube
23. Extremal spectral results related to spanning trees of signed complete graphs
24. Connectivity of Cartesian Product of Hypergraphs
25. The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees
26. Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
27. On forcibly [formula omitted]-connected and forcibly [formula omitted]-arc-connected digraphic sequences
28. Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern
29. Extremal graphs with respect to two distance-based topological indices
30. Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian
31. On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs
32. Arbitrarily Partitionable {2K2, C4}-Free Graphs
33. On the Aα- spectral radius of Halin graphs
34. Paths in [formula omitted]-bipartite hypertournaments
35. Neighbor-connectivity of pancake networks and burnt pancake networks
36. A survey on book-embedding of planar graphs
37. Sufficient Ore type condition for a digraph to be supereulerian
38. The Antistrong Property for Special Digraph Families
39. On the Hamilton laceability of double generalized Petersen graphs
40. Generalizations of the classics to spanning connectedness
41. The [formula omitted]-restricted edge-connectivity of the data center network DCell
42. On the [formula omitted]spectral radius of two types of graphs
43. Edge-connectivity in hypergraphs
44. Conditional fractional matching preclusion of [formula omitted]-dimensional torus networks
45. Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
46. Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
47. Nordhaus-Gaddum type inequalities of the second Aα-eigenvalue of a graph
48. Structure Fault-tolerance of Arrangement Graphs
49. Sufficient conditions for graphs to be spanning connected
50. The distance eigenvalues of the complements of unicyclic 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.