Weijun Liu

activity

20192025

most citedA new matrix inequality involving partial traces

4 citations · 9 across the 16 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2024

Generalized Cayley graphs of complete groups

Qianfen Liao, Liu Weijun

A group $G$ is complete group if it satisfies $Z (G) = e$ and $A u t (G) = I nn (G)$ . In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and character…

math.CO2024

Generalized Cayley graphs and perfect code

Liao Qianfen, Liu Weijun

Perfect code in Cayley graphs and Cayley sum graphs is studied extensively in recent years. In this paper, we consider perfect code in generalized Cayley graphs.

math.CO2023

Some properties of generalized Cayley graphs

Liao Qianfen, Liu Weijun, Zhang Pengli

In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary a…

math.CO2023

Block-transitive $3$ - $(v, k, 1)$ designs on exceptional groups of Lie type

Ting Lan, Weijun Liu, Fu-Gang Yin

Let $D$ be a non-trivial $G$ -block-transitive $3$ - $(v, k, 1)$ design, where $T \leq G \leq Aut (T)$ for some finite non-abelian simple group $T$ . It is proved that i…

math.CO2022

Spectral radius and the $2$ -power of Hamilton cycles

Xinru Yan, Xiaocong He, Lihua Feng +1

Let $G$ be a graph of order $n$ and spectral radius be the largest eigenvalue of its adjacency matrix, denoted by $μ (G)$ . In this paper, we determine the unique graph with maximum…

math.CO2021

A survey on spectral conditions for some extremal graph problems

Yongtao Li, Weijun Liu, Lihua Feng

This survey is two-fold. We first report new progress on the spectral extremal results on the Turán type problems in graph theory. More precisely, we shall summarize the spectral T…

math.CO2021

The Q-index and connectivity of graphs

Peng-Li Zhang, Lihua Feng, Weijun Liu +1

A connected graph $G$ is said to be $k$ -connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connecte…

math.CO2021★ 1 cited

A tight $Q$ -index condition for a graph to be $k$ -path-coverable involving minimum degree

Tao Cheng, Lihua Feng, Yongtao Li +1

A graph $G$ is $k$ -path-coverable if its vertex set $V (G)$ can be covered by $k$ or fewer vertex disjoint paths. In this paper, using the $Q$ -index of a connected graph $G$ , we pre…