What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (92.38%)
- Discrete mathematics (78.03%)
- Graph (35.43%)
What were the highlights of his more recent work (between 2010-2018)?
- Combinatorics (92.38%)
- Discrete mathematics (78.03%)
- Graph (35.43%)
In recent papers he was focusing on the following fields of study:
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.
Between 2010 and 2018, his most popular works were:
- Reliabilities of Consecutive-k Systems (91 citations)
- Roman domination on strongly chordal graphs (58 citations)
- A characterization of graphs with rank 4 (52 citations)
In his most recent research, the most cited papers focused on:
- 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.
