52 citations · 100 across the 32 of their papers we have counts for
32 papers
Anti-Ramsey numbers for vertex-disjoint triangles
Fangfang Wu, Shenggui Zhang, Binlong Li +1
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number…
Counting rainbow triangles in edge-colored graphs
Xueliang Li, Bo Ning, Yongtang Shi +1
Let be an edge-colored graph on vertices. The minimum color degree of , denoted by , is defined as the minimum number of colors assigned to the edges incident to…
Graphs with minimum degree-based entropy
Yanni Dong, Maximilien Gadouleau, Pengfei Wan +1
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees.…
Perfect state transfer in NEPS of complete graphs
Yipeng Li, Xiaogang Liu, Shenggui Zhang +1
Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph with adjacency matrix , the transition matrix of with r…
Properly colored 's in edge-colored graphs
Chuandong Xu, Colton Magnant, Shenggui Zhang
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain…
On characterizing the critical graphs for matching Ramsey numbers
Chuandong Xu, Hongna Yang, Shenggui Zhang
Given simple graphs , the Ramsey number is the smallest positive integer such that every edge-colored with c…