Hong Chang

activity

20162026

most citedDegree sum conditions for graphs to have proper connection number 2

4 citations · 10 across the 15 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016★ 4 cited

Degree sum conditions for graphs to have proper connection number 2

Hong Chang, Zhong Huang, Xueliang Li

A path $P$ in an edge-colored graph $G$ is a \emph{proper path} if no two adjacent edges of $P$ are colored with the same color. The graph $G$ is \emph{proper connected} if, betwee…

math.CO2016★ 1 cited

The $(k, ℓ)$ -proper index of graphs

Hong Chang, Xueliang Li, Colton Magnant +1

A tree $T$ in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an in…

math.CO2016★ 1 cited

Some upper bounds for the $3$ -proper index of graphs

Hong Chang, Xueliang Li, Zhongmei Qin

A tree $T$ in an edge-colored graph is a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be a fixed inte…

Degree sum conditions for graphs to have proper connection number 2

The (k,ℓ)-proper index of graphs

Some upper bounds for the 3-proper index of graphs

The $(k, ℓ)$ -proper index of graphs

Some upper bounds for the $3$ -proper index of graphs