- Home
- Top Scientists - Mathematics
- Gerard J. Chang

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
H-index
33
Citations
5,163
186
World Ranking
1690
National Ranking
8

Computer Science
H-index
33
Citations
5,164
176
World Ranking
6870
National Ranking
52

- Combinatorics
- Discrete mathematics
- Graph theory

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Graph, Chordal graph and Domination analysis. Gerard J. Chang performs multidisciplinary study on Combinatorics and Cube in his works. Discrete mathematics and Upper and lower bounds are frequently intertwined in his study.

His research in Chordal graph intersects with topics in Strongly chordal graph, Graph theory and Bipartite graph. His work in Vertex tackles topics such as Bound graph which are related to areas like Integer. His Interval graph research incorporates elements of Indifference graph and Steiner tree problem.

- The $L(2,1)$-Labeling Problem on Graphs (309 citations)
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs (133 citations)
- On L(d, 1) -labelings of graphs (113 citations)

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Graph, Chordal graph and Bipartite graph. His Combinatorics research focuses on Upper and lower bounds and how it relates to Integer. Maximal independent set, Pathwidth, Split graph, Conjecture and Bound graph are among the areas of Discrete mathematics where Gerard J. Chang concentrates his study.

His work in Maximal independent set covers topics such as Independent set which are related to areas like Dominating set. His work carried out in the field of Graph brings together such families of science as Disjoint sets, Chromatic scale and Graph theory. His research ties Strongly chordal graph and Chordal graph together.

- Combinatorics (92.38%)
- Discrete mathematics (78.03%)
- Graph (35.43%)

- Combinatorics (92.38%)
- Discrete mathematics (78.03%)
- Graph (35.43%)

Gerard J. Chang focuses on Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Bipartite graph. His study in Combinatorics focuses on Vertex, Domination analysis, Vertex, Planar graph and Conjecture. His study in Edge coloring, Bound graph, Graph power, Dominating set and Connectivity is done as part of Discrete mathematics.

His research investigates the connection between Graph power and topics such as Neighbourhood that intersect with problems in Null graph, Complement graph and Symmetric graph. His Graph research integrates issues from Tuple, Partition, Labeling Problem and Real number. His Upper and lower bounds study combines topics from a wide range of disciplines, such as Sequence, Subsequence, Element, Abelian group and Integer.

- Reliabilities of Consecutive-k Systems (91 citations)
- Roman domination on strongly chordal graphs (58 citations)
- A characterization of graphs with rank 4 (52 citations)

- Combinatorics
- Discrete mathematics
- Graph theory

His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Vertex and Bipartite graph. All of his Combinatorics and Domination analysis, Chordal graph, Vertex, Planar graph and Connectivity investigations are sub-components of the entire Combinatorics study. His Vertex research is multidisciplinary, incorporating elements of Arithmetic and Real number.

Gerard J. Chang is studying Conjecture, which is a component of Discrete mathematics. The study incorporates disciplines such as Cartesian product, Equitable coloring, Chromatic threshold, Minimum weight and Upper and lower bounds in addition to Vertex. He has included themes like Perfect graph, Maximal independent set, Indifference graph, Independent set and Block graph in his Split graph study.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

The $L(2,1)$-Labeling Problem on Graphs

Gerard J. Chang;David Kuo.

SIAM Journal on Discrete Mathematics **(1996)**

569 Citations

On L(d, 1) -labelings of graphs

Gerard J. Chang;Wen-Tsai Ke;David Kuo;Daphne D.-F. Liu.

Discrete Mathematics **(2000)**

211 Citations

The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs

Gerard J. Chang;George L. Nemhauser.

Siam Journal on Algebraic and Discrete Methods **(1984)**

208 Citations

Reliabilities of Consecutive-k Systems

Gerard J. Chang;Frank Hwang;Lirong Cui.

**(2011)**

181 Citations

k -tuple domination in graphs

Chung-Shou Liao;Gerard J. Chang.

Information Processing Letters **(2003)**

138 Citations

Algorithmic Aspects of Domination in Graphs

Gerard Jennhwa Chang.

**(1998)**

133 Citations

Note: Power domination in graphs

Min Zhao;Liying Kang;Gerard J. Chang.

Discrete Mathematics **(2006)**

132 Citations

Circular chromatic numbers of Mycielski's graphs

Gerard J. Chang;Lingling Huang;Xuding Zhu.

Discrete Mathematics **(1999)**

125 Citations

Diagnosabilities of regular networks

Guey-Yun Chang;G.J. Chang;Gen-Huey Chen.

IEEE Transactions on Parallel and Distributed Systems **(2005)**

114 Citations

Rainbow domination on trees

Gerard J. Chang;Jiaojiao Wu;Xuding Zhu.

Discrete Applied Mathematics **(2010)**

98 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

National Yang Ming Chiao Tung University

Zhejiang Normal University

Indian Institute of Technology Madras

Georgia Institute of Technology

Carnegie Mellon University

Clemson University

University of Pannonia

University of Illinois at Urbana-Champaign

University of Illinois at Chicago

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.