3 citations · 15 across the 14 of their papers we have counts for
14 papers
A complete characterization of split digraphs with a strong arc decomposition
Jiangdong Ai, Fankang He, Zhaoxiang Li +2
A \textbf{strong arc decomposition} of a (multi-)digraph is a partition of its arc set into two disjoint arc sets and such that both of the spanning subdi…
Exact rainbow numbers for matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi +1
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Improved bounds for rainbow numbers of matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Degree powers in graphs with a forbidden forest
Yongxin Lan, Henry Liu, Zhongmei Qin +1
Given a positive integer and a graph with degree sequence , we define . Caro and Yuster introduced a Turán-type problem for $e_p(G…
The Turan number of 2P_7
Yongxin Lan, Zhongmei Qin, Yongtang Shi
The Turán number of a graph , denoted by , is the maximum number of edges in any graph on vertices which does not contain as a subgraph. Let denote the…
The -proper index of graphs
Hong Chang, Xueliang Li, Colton Magnant +1
A tree in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of receive the same color. Let be a connected graph of order and be an in…
Some upper bounds for the -proper index of graphs
Hong Chang, Xueliang Li, Zhongmei Qin
A tree in an edge-colored graph is a {\it proper tree} if no two adjacent edges of receive the same color. Let be a connected graph of order and be a fixed inte…
On two conjectures about the proper connection number of graphs
Fei Huang, Xueliang Li, Zhongmei Qin +2
A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph , the proper connection number of…
Solution to a conjecture on the proper connection number of graphs
Fei Huang, Xueliang Li, Zhongmei Qin +1
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph , the proper connection number …
Proper connection number of random graphs
Ran Gu, Xueliang Li, Zhongmei Qin
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph , the proper connection number o…
Colorful monochromatic connectivity of random graphs
Ran Gu, Xueliang Li, Zhongmei Qin
An edge-coloring of a connected graph is called a {\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic p…
Novel Inequalities for Generalized Graph Entropies Revisited, Graph Energies and Topological Indices
Xueliang Li, Zhongmei Qin, Meiqin Wei +2
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to informatio…
An extension of Mantel's theorem to random 4-uniform hypergraphs
Ran Gu, Xueliang Li, Zhongmei Qin +2
A sparse version of Mantel's Theorem is that, for sufficiently large , with high probability (w.h.p.), every maximum triangle-free subgraph of is bipartite. DeMarco and…
Non-jumping Numbers for 5-Uniform Hypergraphs
Ran Gu, Xueliang Li, Zhongmei Qin +2
Let and be integers. A real number is a jump for if for any and any integer , any -uniform graph with $n > n_0(\varep…