66 citations · 607 across the 204 of their papers we have counts for
11 papers · 1 filter
Total proper connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a {\it total proper path} if any two a…
Hardness result for the total rainbow -connection of graphs
Wenjing Li, Xueliang Li, Di Wu
A path in a total-colored graph is called \emph{total rainbow} if its edges and internal vertices have distinct colors. For an -connected graph and an integer with $1…
Proper connection number and 2-proper connection number of a graph
Fei Huang, Xueliang Li, Shujing Wang
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored with one same color. An edge-colored graph is called -proper connected i…
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…
On (strong) proper vertex-connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang +1
A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex -connected} if…
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…