2 citations · 3 across the 6 of their papers we have counts for
6 papers
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.
Isometric-path numbers of block graphs
Jun-Jie Pand, Gerard J. Chang
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), is the minimum number of isometric paths requ…
Distance-two labelings of digraphs
G. J. Chang, J. -J. Chen, D. Kuo +1
For positive integers , an -labeling of a digraph is a function from into the set of nonnegative integers such that if is adja…
Isometric path numbers of graphs
Jun-Jie Pan, Gerard J. Chang
An isometric path between two vertices in a graph is a shortest path joining them. The isometric path number of , denoted by $\ip(G)$, is the minimum number of isometric pat…