Supported by the National Natural Science Foundation of China(Grant Nos.12071265;12271331);the Natural Science Foundation of Shandong Province(Grant No.ZR202102250232).
An equitable(O^(1)_(k),O^(2)_(k),...,O^(m)_(k))-partition of a graph G,which is also called a k cluster m-partition,is the partition of V(G)into m non-empty subsets V_(1),V_(2),...,Vm such that for every integer i in{...
partially supported by the National Natural Science Foundation of China(Grant No.11971196);Hubei Provincial Science and Technology Innovation Base(Platform)Special Project 2020DFH002;the second author was partially supported by the National Natural Science Foundation of China(Grant Nos.11901318,12131013);the Young Elite Scientists Sponsorship Program by Tianjin(Grant No.TJSQNTJ-2020-09)。
A Steinberg-type conjecture on circular coloring is recently proposed that for any prime p≥5,every planar graph of girth p without cycles of length from p+1 to p(p-2)is Cp-colorable(that is,it admits a homomorphism t...
Supported by the National Natural Science Foundation of China(Grant Nos.12071265;12271331);the Natural Science Foundation of Shandong Province(Grant No.ZR202102250232).
An(O_(k1),O_(k2))-partition of a graph G is the partition of V(G)into two non-empty subsets V_(1) and V2,such that G[V_(1)]and G[V_(2)]are graphs with components of order at most k_(1) and k_(2),respectively.In this p...
Supported by National Natural Science Foundation of China(Grant No.12071442);the Fundamental Research Funds for the Central Universities under(Grant No.020314380035)。
It is well-known that the Petersen graph is nonhamiltonian.A very short proof for this result was presented in[2]due to D.B.West.In this note,by extending the proof technique in[2],we briefly show that the girth of ev...
supported by the National Natural Science Foundation of China(Nos.11771443,12071265)。
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most two receive distinct colors.A list assignment of a graph G is a mapping L which assigns to each vertex v a set ...
the National Natural Science Foundation of China(No.11771403).
A coloring of a graph G is injective if its restriction to the neighbour of any vertex is injective.The injective chromatic number x_(i)(G)of a graph G is the least k such that there is an injective k-coloring.In this...
The work of L.-P.Wang was supported in part by the National Natural Science Foundation of China(Grant No.61872355);National Key Research and Development Program of China(Grant No.2018YFA0704703).
We introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which has a similar structure with Wenger graphs. We give a tight upper bound of the diameter for these graphs and the exact diameter...
supported in part by National Key Research and Development Program of China(Grant No.2018YFB1003203);National Natural Science Foundation of China(Grants No.61972447);Fundamental Research Funds for the Central Universities(Grant No.2019kfy XKJC021)。
Computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garne...
Supported by the National Natural Science Foundation of China(Grant Nos.11601093,12025109,12071489 and 61976104);the Research Fund of Guangdong University of Foreign Studies(Grant Nos.299-X5219228 and 297-ZW200011)。
Lin-Lu-Yau introduced a notion of Ricci curvature for graphs and obtained a complete classification for all Ricci-flat graphs with girth at least five.In this paper,we characterize all Ricci-flat graphs of girth four ...
To meet the requirements of pipeline consumers abroad,in this study,an automatic gas metal arc welding type of girth welding was performed with a heat input of no more than 0.25 kJ/mm and high-strength solid-wire matc...