2 citations · 3 across the 4 of their papers we have counts for
6 papers
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
Jia Guo
The connectivity and edge connectivity of interconnection network determine the fault tolerance of the network. An interconnection network is usually viewed as a connected graph, w…
On the anti-Ramsey number of forests
Chunqiu Fang, Ervin Győri, Mei Lu +1
We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph in a complete graph , denoted…
Edge-bipancyclicity of bubble-sort star graphs
Jia Guo, Mei Lu
The interconnection network considered in this paper is the bubble-sort star graph. The -dimensional bubble-sort star graph is a bipartite and -regular graph of o…
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Yi Zhang, Yi Zhao, Mei Lu
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that is a 3-uniform h…
Some bounds on the eigenvalues of uniform hypergraphs
Xiying Yuan, Man Zhang, Mei Lu
Let be a uniform hypergraph. Let and be the adjacency tensor and the signless Laplacian tensor of , respectively. In th…
Algebraic Cayley Graphs over Finite Fields
Mei Lu, Daqing Wan, Li-Ping Wang +1
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new…