Chang Gerard J.

Gerard J. Chang

Information about the author Gerard J. Chang will soon be added to the site.
Found 6 papers in total
Pseudo-Hamiltonian-connected graphs
Pseudo-Hamiltonian-connected graphs
2000
Given a graph G and a positive integer k , denote by G[k] the graph obtained from G by...
The β-assignment problems
The β-assignment problems
1998
Suppose G = (S, T, E) is a bipartite graph, where ( S, T ) is a bipartition of the...
The &bgr;-assignment problem in general graphs
The &bgr;-assignment problem in general graphs
1997
We study a variation of the assignment problem in operations research and formulate it...
Set to set broadcasting in communication networks
Set to set broadcasting in communication networks
1992
Suppose G=(V,E) is a graph whose vertices represent people and edges represent...
The k-neighbor domination problem
The k-neighbor domination problem
1991
As a model of certain location problem, the authors consider the following domination...
Total domination in block graphs
Total domination in block graphs
1989
A set of vertices D is a dominating set for a graph G=(V,E) if every vertex in V-D is...
Papers per page: