66 citations · 78 across the 9 of their papers we have counts for
9 papers
Complete bipartite graphs without small rainbow stars
Weizhen Chen, Meng Ji, Yaping Mao +1
The -edge-colored bipartite Gallai-Ramsey number is defined as the minimum integer such that and for every , every edge-colo…
Distance proper connection of graphs and their complements
Xueliang Li, Colton Magnant, Meiqin Wei +1
Let be an edge-colored connected graph. A path in is called a distance -proper path if no two edges of the same color can appear with less than edges in be…
Distance proper connection of graphs
Xueliang Li, Colton Magnant, Meiqin Wei +1
Let be an edge-colored connected graph. A path in is called a distance -proper path if no two edges of the same color appear with fewer than edges in betwe…
A survey of recent results in (generalized) graph entropies
Xueliang Li, Meiqin Wei
The entropy of a graph was first introduced by Rashevsky \cite{Rashevsky} and Trucco \cite{Trucco} to interpret as the structural information content of the graph and serve as a co…
Proper connection number and connected dominating sets
Xueliang Li, Meiqin Wei, Jun Yue
The proper connection number of a connected graph is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of i…
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…
Additive codes over from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
In , Danielsen and Parker \cite{DP} proved that every self-dual additive code over is equivalent to a graph code. So, graph is an important tool for searching (propos…
Formally self-dual linear binary codes from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In t…
On a conjecture about tricyclic graphs with maximal energy
Xueliang Li, Yongtang Shi, Meiqin Wei +1
For a given simple graph , the energy of , denoted by , is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was de…