198 citations
- Lanzhou UniversityCN37 papers
- Institute of Theoretical PhysicsCN14 papers
- Nankai UniversityCN13 papers
- Institute of Modern PhysicsCN11 papers
- Ludong UniversityCN6 papers
- Oakland UniversityUS5 papers
- Beijing Normal UniversityCN4 papers
- China Jiliang UniversityCN4 papers
- Qinghai UniversityCN4 papers
- Georgia Southern UniversityUS3 papers
- Northwest Normal UniversityCN3 papers
- Chinese Academy of SciencesCN2 papers
9 papers · 1 filter
Four identities related to third order mock theta functions
Su-Ping Cui, Nancy S. S. Gu, Chen-Yang Su
Ramanujan presented four identities for third order mock theta functions in his Lost Notebook. In 2005, with the aid of complex analysis, Yesilyurt first proved these four identiti…
Monochromatic -edge-connection colorings of graphs
Ping Li, Xueliang Li
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic $…
Structure and enumeration results of matchable Lucas cubes
Xu Wang, Xuxu Zhao, Haiyuan Yao
A lucasene is a hexagon chain that is similar to a fibonaccene, an -fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the correspondi…
Prediction for mesons
Cheng-Qun Pang, Ya-Rong Wang, Chao-Hui Wang
In this paper, we study the spectrum and decay behavior of meson family which is still missing in experiment. By the modified Godfrey-Isgur model with a color screening ef…
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
Zhao Wang, Yaping Mao, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
Conflict-free connection number of random graphs
Ran Gu, Xueliang Li
An edge-colored graph is conflict-free connected if any two of its vertices are connected by a path which contains a color used on exactly one of its edges. The conflict-free c…