The following pages link to Xue Liang Li (Q831023):
Displaying 50 items.
- (Q234413) (redirect page) (← links)
- More on borderenergetic graphs (Q254912) (← links)
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound (Q264853) (← links)
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- The Steiner Wiener index of a graph (Q274705) (← links)
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- Note on the upper bound of the rainbow index of a graph (Q298957) (← links)
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179) (← links)
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs (Q302013) (← links)
- The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs (Q310735) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- Rainbow connection number and independence number of a graph (Q343733) (← links)
- Rainbow connection in 3-connected graphs (Q367069) (← links)
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← links)
- The skew energy of random oriented graphs (Q389735) (← links)
- Skew spectra of oriented bipartite graphs (Q396938) (← links)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- On extremal graphs with internally disjoint Steiner trees (Q400783) (← links)
- Tricyclic graphs with maximal revised Szeged index (Q406325) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← links)
- Rainbow connection number and connectivity (Q426778) (← links)
- On maximum Estrada indices of bipartite graphs with some given parameters (Q471942) (← links)
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs (Q472428) (← links)
- Rainbow connection number and the number of blocks (Q489352) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Tricyclic oriented graphs with maximal skew energy (Q506206) (← links)
- The spectral distribution of random mixed graphs (Q512071) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- On the difference of two generalized connectivities of a graph (Q512888) (← links)
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs (Q541944) (← links)
- The asymptotic value of the Randić index for trees (Q550268) (← links)
- The energy of random graphs (Q550606) (← links)
- On the maximal energy tree with two maximum degree vertices (Q551355) (← links)
- On unicyclic conjugated molecules with minimal energies (Q551842) (← links)
- The spread of unicyclic graphs with given size of maximum matchings (Q551847) (← links)
- On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
- A note on the von Neumann entropy of random graphs (Q603103) (← links)
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs (Q624542) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Complete solution to a conjecture on the maximal energy of unicyclic graphs (Q641541) (← links)
- The covering values for acyclic digraph games (Q647347) (← links)
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs (Q648422) (← links)
- On graphs with maximum Harary spectral radius (Q669436) (← links)
- Hexagonal systems with forcing single edges (Q674445) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- On ``The matching polynomial of a polygraph'' (Q689958) (← links)
