Zhongyuan Che, Ph.D.

Zhongyuan Che
Professor, Mathematics
[email protected]
Room 109, Laboratory Classroom Building

Zhongyuan Che, Ph.D., professor of mathematics, teaches calculus courses, matrices, differential equations, and mathematical problem solving.    

She focuses on theoretical rigor and educational mentorship. Students in her classes can expect to be active learners both in and out of the classroom, to participate in in-class discussions and presentations, contribute ideas during in-class exercises, and develop an effective practice of developing math problem solving skills. She is renowned for her engaging office hours where students visit her in her office outside of class to follow up on course content.

Dr. Che’s classes prepare students for careers in science and engineering and related STEM fields. 

 

  • Graph theory
  • Combinatorics

A decomposition structure of resonance graphs that are daisy cubes, Discrete Applied Mathematics, 377 (2025), 529-540. - 2025
Collaborator: Zhibo Chen

Resonance graphs of plane bipartite graphs as daisy cubes, Discrete Applied Mathematics, 366 (2025), 75-85.
Collaborators: Simon Brezovnik; Niko Tratnik; Petra Žigert Pleteršek

Outerplane bipartite graphs with isomorphic resonance graphs, Discrete Applied Mathematics, 343 (2024), 340-349 - 2024
Collaborators: Simon Brezovnik; Niko Tratnik; Petra Žigert Pleteršek

(k+1)-line graphs of k-trees, Australasian Journal of Combinatorics 87 (2023), 12-23 - 2023

Graph irregularities of maximal k-degenerate graphs, Discrete Applied Mathematics 331(2023), 70-87 - 2023
Collaborator: Allan Bickle

k-Wiener index of a k-plex, Journal of Combinatorial Optimization 43, 65-78 (2022). - 2022

Wiener indices of maximal k-degenerate graphs, Graphs and Combinatorics 37 (2021), 581-589 - 2021
Collaborator: Allan Bickle, Co-Author

Peripheral convex expansions of resonance graphs, Order, 38 (2021), 365-376 - 2021

Cube-free resonance graphs, Discrete Applied Mathematics 284 (2020), 262-268. - April, 2020

A Characterization of the resonance graph of an outerplane bipartite graph, Discrete Applied Mathematics, 258 (2019), 264-268. - 2019

An upper bound on Wiener indices of maximal planar graphs, Discrete Applied Mathematics, 258 (2019), 76-86. - 2019
Collaborator: Karen Collins, Co-Author

Plane elementary bipartite graphs with forcing or anti-forcing edges, Graphs and Combinatorics, 35 (2019), 959-971. - 2019
Collaborator: Zhibo Chen, Co-Author

Forcing and anti-forcing edges in bipartite graphs, Discrete Applied Mathematics, 244 (2018), 70-77. - 2018
Collaborator: Zhibo Chen, Co-Author

Structural properties of resonance graphs of plane elementary bipartite graphs, Discrete Applied Mathematics, 247 (2018), 102-110. - 2018

Lower and Upper Bounds of the Forgotten Topological Index, MATCH Communications in Mathematical and in Computer Chemistry 76 (2016), 635-648. - 2016
Collaborator: Zhibo Chen, Co-Author

Minimum order of r-regular bipartite graphs of pair length k, Australasian Journal of Combinatorics 66 (2016), 50–65. - 2016
Collaborator: Zhibo Chen, Co-Author

Sharp bounds on the size of pairable graphs and pairable bipartite graphs, Australasian Journal of Combinatorics 62 (2015), 172–183. - 2015
Collaborator: Zhibo Chen, Co-Author

Conjugated Circuits and Forcing Edges, MATCH Communications in Mathematical and in Computer Chemistry 69 (2013), 721-732. - 2013
Collaborator: Zhibo Chen, Co-Author

Forcing Faces in Plane Bipartite Graphs (II), Discrete Applied Mathematics 161 (2013), 71–80. - 2013
Collaborator: Zhibo Chen, Co-Author

The Distinguishing Chromatic Number of Kneser Graphs, Electronic Journal of Combinatorics 20 (2013), paper 23. - 2013
Collaborator: Karen Collins, Co-Author

Forcing on Perfect Matchings: A Survey, MATCH Communications in Mathematical and in Computer Chemistry 66 (2011) 93–136. - 2011
Collaborator: Zhibo Chen, Co-Author

Existence of Perfect Matchings in a Plane Bipartite Graph, Czechoslovak Mathematical Journal 60 (2010), 489–494. - 2010

On k-pairable regular graphs , Discrete Mathematics 310 (2010), 3334–3350. - 2010
Collaborator: Zhibo Chen, Co-Author

Finding Repeats Within Strings, DIMACS EDUCATIONAL MODULES SERIES, December 2009. - 2009
Collaborators: Dina Sokol, Co-Author; Frederick Adkins, Co-Author; Kristin Pfabe, Co-Author

Forcing faces in plane bipartite graphs, Discrete Mathematics 308 (2008), 2427–2439. - 2008
Collaborators: Zhibo Chen, Co-Author; Array Array

Odd-angulated Graphs and Cancelling Factors in Box Products, Journal of Graph Theory 58 (2008), 221–238. - 2008
Collaborators: Collins Karen, Co-Author; Tardif Claude, Co-Author

Uniquely k-pairable graphs, Discrete Mathematics 308 (2008), 6104–6110. - 2008

On k-Pairable Graphs from Trees, Czechoslovak Mathematical Journal 57 (2007), 377–386. - 2007
Collaborator: Array Array

Retracts of box products with odd-angulated factors, Journal of Graph Theory 54 (2007), 24–40. - 2007
Collaborator: Karen Collins, Co-Author

Forcing Hexagons in Hexagonal Systems, MATCH Communications in Mathematical and in Computer Chemistry 56 (2006),649–668. - 2006
Collaborators: Zhibo Chen, Co-Author; Array Array

MA, Computer Science, Wesleyan University

Ph D, Mathematics, Wesleyan University

MS, Mathematics, Shandong University

BS, Mathematics , Shandong University

May, 2025

Array
Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2025)
University of Ottawa, Ottawa, Canada

March, 2024

Oral Presentations
Resonance graphs of plane bipartite graphs as daisy cube
55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Boca Raton, FL

June, 2023

Oral Presentations
Peripheral Convex Expansions of Resonance Graphs
10th Slovenian International Conference on Graph Theory
Kranjska Gora, Slovenian

June, 2022

Oral Presentations
Irregularities of maximal k-degenerate graph
AWM Research Symposium

March, 2022

Oral Presentations
(k+1)-line graphs of k-trees
53rd Southeastern International Conference on Combinatorics, Graph Theory and Computing
Virtual Conference

August, 2021

MAA MathFest 2021
Virtual Conference

April, 2021

Oral Presentations
k-Wiener indices of k-plexes
63rd installment of the MIdwestern GrapH TheorY (MIGHTY) Conference
Virtual Conference

March, 2021

Oral Presentations
Dimensional k-Wiener index of a k-plex
52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing
Boca Raton, FL

March, 2021

Webinars
Best Practices for Remote Exam Design with WebAssign
Zoom Webinar

March, 2021

Webinars
Cengage Master Class – WebAssign Gradebook Deep Dive
Zoom Webinar

January, 2021

Webinars
Getting Started with WebAssign
Zoom Webinar

September 15, 2020

Webinars
The Top 5 Features You Aren't Using in WebAssign
Navigating What's Next: Helping Students Thrive in Your New Course Format, A professional Development Series
Zoom Webinar

August 14, 2020

Webinars
Course Management with WebAssign, by Dr. Dale Dawes
WebAssign Special Events
Zoom Webinar

June 30, 2020

Colloquiums
Diagonal Structures and Permutation Groups, by Cheryl Praeger
Virtual Combinatorics Colloquium
Zoom Colloquium

April 7, 2020

Colloquiums
Recent Progress On the Erdos-Hajnal Conjecture, by Maria Chudnovsky
Virtual Combinatorics Colloquium
Zoom Colloquium

March 31, 2020

Seminars
TPSE's Top ten things every online instructor should do
MIT Electronic Seminar on Mathematics Education
Zoom Seminar

February 18, 2020

Colloquiums
Trivalent Graphs, Perfect Matchings, and Virtual Knot Theory, by Louis H. Kauffman.
Virtual Combinatorics Colloquium
Zoom Colloquium

January, 2020

Oral Presentations
Peripheral convex expansions of resonance graphs
Joint Mathematics Meetings
Denver, CO

October, 2019

Oral Presentations
Wiener indices of maximal k-degenerate graphs
33rd Midwest Conference on Combinatorics, Cryptography and Computing
Rochester, NY

June, 2019

Oral Presentations
Resonance graphs of plane elementary bipartite graphs
9th Slovenian International Conference on Graph Theory
Bled, Slovenian

March, 2019

Oral Presentations
An upper bound on Wiener indices of maximal planar graphs
50th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Boca Raton, FL

January, 2019

Oral Presentations
A characterization of the resonance graph of an outerplane bipartite graph
Joint Mathematics Meetings
Baltimore, MD

August, 2018

Oral Presentations
A decomposition structure of resonance graphs of plane elementary bipartite graphs
Kliakhandler Conference - Graph Decompositions
Houghton, MI

July, 2018

Oral Presentations
A decomposition structure of resonance graphs of plane elementary bipartite graphs
Summer Combo in Vermont
Colchester, VT

April, 2018

Oral Presentations
Forcing and anti-forcing edges in bipartite graphs
59th Midwestern Graph Theory Conference
Morgantown, WV

July, 2017

Mathematical Association of America (MAA) MathFest 2017
Chicago, IL

January, 2017

Joint Mathematics Meetings
Atlanta, GA

August, 2016

MAA MathFest
Columbus, OH

April, 2016

MAA Allegheny Mountain Section Meeting, Spring 2016
Erie, PA

July, 2015

17th International Conference on Random Structures and Algorithm
Pittsburgh, PA

January, 2015

Joint Mathematics Meetings
San Antonio, TX

May, 2014

27th Cumberland Conference on Combinatorics, Graph Theory & Computing
West Virginia University, Morgantown, WV,

December, 2013

10th Workshop on Algorithms and Models for the Web Graph (WAW 2013)
Boston, MA

November, 2013

Atlanta Lecture Series in Combinatorics and Graph Theory X
Atlanta, GA

August, 2013

MAA MathFest
Hartford, CT

July, 2013

Summer Combo in Vermont
Colchester, VT

May, 2013

Conference on Model-Theoretic Algebra In Honor of Carol Wood
Middletown, CT

January, 2012

Joint Mathematics Meetings
Boston, MA

2011

Colloquiums
Math Colloquium (Weekly, Spring 2011)
Middletown, CT

2011

Seminars
Knot Theory Seminar (Weekly, Spring 2011)
Middletown, CT

October, 2010

Oral Presentations
Forcing on Perfect Matchings in Plane Bipartite Graphs
Topological Seminar and Math Colloquium
Middletown, CT

A perfect matching of a graph is a set of a disjoint edges that covers all vertices of the graph. A perfect matching of a benzenoid graph is also called a Kekule structure in chemistry. The forcing number of a perfect matching M is the cardinality of a smallest subset of M which completely determines M. The root of this concept came from the innate degree of freedom of a Kekule structure in a benzenoid graph, which is a 2-connected plane bipartite graph whose each interior face is a unit hexagon. If a Kekule structure has a forcing bond, then its innate degree of freedom is at most 1. In this talk, we will introduce the concept of forcing hexagons of a benzenoid, characterize those benzenoids with forc- ing hexagons, give the coexistence property of forcing edges and forcing hexagons in a benzenoid graph, and explain their related chemical properties. Then we extend this concept to forcing faces of general plane bipartite graph. This is a joint work with my colleague Zhibo Chen from Penn State University, Greater Allegheny Campus.

August 4, 2010 - August 7, 2010

Keynotes/Plenary Addresses
Forcing on Perfect Matchings
International Conference on Mathematical Chemistry
Xiamen, China

Collaborator: Zhibo Chen, Author and Presenter

March, 2010

CoNE Revisited, in memory of Mike Albertson
Northampton, MA

January, 2009

Oral Presentations
Forcing Faces in Plane Bipartite Graphs
Joint Mathematics Meetings
Washington, D.C.

April, 2008

MAA Allegheny Mountain Section Meeting, Spring 2008
Pittsburgh, PA

April, 2008

Oral Presentations
Uniquely Pairable Graphs
46th Midwestern Graph Theory Conference
Morgantown, WV

January, 2008

Oral Presentations
Uniquely Pairable Graphs
Joint Mathematics Meetings
San Diego, CA

May, 2007

Workshops
Workshop on Extremal Graphs and Hypergraphs
Pittsburgh, PA

April, 2007

MAA Allegheny Mountain Section Meeting, Spring 2007
Erie, PA

January, 2007

Oral Presentations
Forcing Hexagons in Hexagonal Systems
Joint Mathematics Meetings
New Orleans, LA

November, 2006

Oral Presentations
On k-Pairable Graphs (II)
Penn State Erie Math Department Seminar
Erie, PA

May, 2006

Oral Presentations
On k-Pairable Graphs (II)
The 19th Cumberland Conference on Combinatorics, Graph Theory, and Computing,
East Tennessee State University, Johnson City, TN

April, 2006

MAA Allegheny Mountain Section Meeting, Spring 2006
Huntingdon, PA

November, 2005

Oral Presentations
The Core of a Cartesian Product Graph with n many Odd-angulated Factors
University of Pittsburgh Discrete Math Seminar
Pittsburgh, PA

October, 2005

Oral Presentations
The Core of a Cartesian Product Graph with n many Odd-angulated Factors
19th Midwest Conference on Combinatorics, Cryptography and Computing (MCCCC)
Rochester, NY

October, 2005

Workshops
Frieze Fest 2005, A Workshop to Celebrate the 60th Birthday of Alan Frieze (on probabilistic combinatorics and randomized algorithms)
Pittsburgh, PA

May, 2005

Graph Theory with Altitude (in honor of Joan P. Hutchinson's 60th Birthday)
Denver, CO

May, 2005

Workshops
WaterMellon Workshop on Extremal Graph Theory (University Waterloo & Carnegie Mellon University)
Pittsburgh, PA

March, 2005

Oral Presentations
Information-theoretic Approaches to the Comparative Analysis of RNA Sequences
RIT Undergraduate Students Math Club
Rochester, NY

January, 2005

MAA Short Course - Eight Lectures on Random Graphs
Atlanta, GA

January, 2005

Oral Presentations
Cartesian product Cores with Myceilski Construction Graphs
Joint Mathematics Meetings
Atlanta, GA

August, 2004

DIMACS Reconnect 2004 - Integrating Information from Sequence and Evolution An introduction to Computational Biology
Piscataway, NJ

June, 2004

DIMACS Reconnect Satellite Conference 2004 - Experimental Algorithms, with a Focus on Branch and Bound for Discrete Optimization Problems
Easton, PA

March, 2004

MAA Allegheny Mountain Section Meeting, Spring 2004
Buckhannon, WV

January, 2004

Oral Presentations
A Note on Circular Colorings and Circular Chromatic Number
Joint Mathematics Meetings
Phoenix, AZ