Chris Godsil spends much of his time researching Discrete mathematics, Combinatorics, Graph, Adjacency matrix and Chordal graph. His Discrete mathematics research incorporates themes from Quantum information science and Spectrum. His work in Vertex-transitive graph, Graph theory, Conjecture, Symmetric group and Matching polynomial is related to Combinatorics.
His Graph study combines topics in areas such as Polynomial, Perfect state transfer and Hermite polynomials. Many of his studies involve connections with topics such as Indifference graph and Chordal graph. His research brings together the fields of Cograph and Graph product.
Chris Godsil mostly deals with Combinatorics, Discrete mathematics, Graph, Adjacency matrix and Quantum walk. The Combinatorics study combines topics in areas such as Matrix and Eigenvalues and eigenvectors. His Graph study integrates concerns from other disciplines, such as Spectral radius, Homomorphism, Conjecture, Chromatic scale and Perfect state transfer.
In his study, Degree matrix is strongly linked to Seidel adjacency matrix, which falls under the umbrella field of Adjacency matrix. Chris Godsil combines subjects such as Algebraic graph theory, Laplacian matrix and Bipartite graph with his study of Quantum walk. His study looks at the relationship between Chordal graph and topics such as Indifference graph, which overlap with Pathwidth, Clique-sum and Metric dimension.
His primary areas of study are Combinatorics, Quantum walk, Graph, Discrete mathematics and Matrix. His Combinatorics research is multidisciplinary, relying on both Eigenvalues and eigenvectors and Mixing. Chris Godsil studied Quantum walk and Strongly regular graph that intersect with Paley graph.
His Graph study which covers Chromatic scale that intersects with Graph coloring, Conjecture and Finite group. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Projection, Quantum and Perfect state transfer. His Matrix research incorporates elements of Centralizer and normalizer, Automorphism and Projection.
Chris Godsil mainly investigates Combinatorics, Quantum walk, Discrete mathematics, Cayley graph and Graph. His research integrates issues of Positive-definite matrix and Eigenvalues and eigenvectors in his study of Combinatorics. His Quantum walk research is multidisciplinary, incorporating elements of Strongly regular graph, Mixing and Bipartite graph.
The concepts of his Discrete mathematics study are interwoven with issues in Quantum, Quantum computer and Perfect state transfer. His Cayley graph study combines topics in areas such as Characterization and Cartesian coordinate system. His Adjacency matrix study combines topics from a wide range of disciplines, such as Embedding and Computation.
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.
Algebraic Graph Theory
Christopher David Godsil;Gordon Royle.
STRONGLY REGULAR GRAPHS
Chris Godsil;Gordon Royle.
On the full automorphism group of a graph
Chris D. Godsil.
On the theory of the matching polynomial
Chris D. Godsil;Ivan Gutman.
Journal of Graph Theory (1981)
Zero forcing sets and the minimum rank of graphs
Francesco Barioli;Wayne Barrett;Steve Butler;Sebastian M. Cioabă.
Linear Algebra and its Applications (2008)
Constructing cospectral graphs
C. D. Godsil;C. D. Godsil;B. D. McKay;B. D. McKay.
Aequationes Mathematicae (1982)
A new graph product and its spectrum
C.D. Godsil;B.D. McKay.
Bulletin of The Australian Mathematical Society (1978)
Cycles in graphs
Brian Roger Alspach;Christopher David Godsil.
North-holland Mathematics Studies (1985)
State transfer on graphs
Discrete Mathematics (2012)
Feasibility conditions for the existence of walk-regular graphs
C.D. Godsil;B.D. McKay.
Linear Algebra and its Applications (1980)
If you think any of the details on this page are incorrect, let us know.
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: