20 citations · 23 across the 8 of their papers we have counts for
9 papers
On the precise value of the strong chromatic-index of a planar graph with a large girth
Gerard Jennhwa Chang, Guan-Huei Duh
A strong -edge-coloring of a graph is a mapping from to such that every pair of distinct edges at distance at most two receive different colors. Th…
Edge Roman domination on graphs
Gerard J. Chang, Sheng-Hua Chen, Chun-Hung Liu
An edge Roman dominating function of a graph is a function satisfying the condition that every edge with is adjacent to some e…
On the number of subsequences with a given sum in a finite abelian group
Gerard Jennhwa Chang, Sheng-Hua Chen, Yongke Qu +2
Suppose is a finite abelian group and is a sequence of elements in . For any element of , let denote the number of subsequences of with sum . The…
Locally connected spanning trees on graphs
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
A locally connected spanning tree of a graph is a spanning tree of such that the set of all neighbors of in induces a connected subgraph of for every $v\in…
Diagnosabilities of regular networks
Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen
In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two differ…
A note on equitable colorings of forests
Gerard J. Chang
This note gives a short proof on characterizations of a forest to be equitably k-colorable.