Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Yingbin
Contact Yingbin, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck RackActions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Articles
Effects of Stumping and Meteorological Factors on Sap Flow Characteristics of Haloxylon ammodendron in Ulan Buh Desert, Northwestern China
All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess.
Graphs with Strong Proper Connection Numbers and Large Cliques
2. (Strong) Proper Connection and Clique Number In this section, we investigate graphs with a small (strong) proper connection number and a large clique number. We first introduce some definitions that will be used later. A Hamiltonian path in a graph G is a path containing every vertex of G. A graph with a Hamiltonian path is called a traceable graph.
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Yingbin
Contact Yingbin, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack