75 citations · 297 across the 21 of their papers we have counts for
22 papers
Localization of spectral Turán theorems for signed graphs
Linfeng Xie, Xiaogang Liu
In this paper, we extend localized Turán theorems to signed graphs and study the corresponding spectral Turán problems. Firstly, we establish a vertex-localized Turán-type inequali…
Fractional revival on semi-Cayley graphs over abelian groups
Jing Wang, Ligong Wang, Xiaogang Liu
In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley…
Fractional revival on Cayley graphs over abelian groups
Jing Wang, Ligong Wang, Xiaogang Liu
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over f…
Laplacian state transfer in vertex complemented coronas
Qiang Wang, Xiaogang Liu
In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in vertex complemented coronas. We prove that there is no L…
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…
Necessities and sufficiencies of a class of permutation polynomials over finite fields
Xiaogang Liu
For the finite field , permutation polynomials of the form are studied. Necessary and sufficient conditions are given for the polynomial…
Further results on some classes of permutation polynomials over finite fields
Xiaogang Liu
Let denote the finite fields with elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have b…
Constructions and necessities of some permutation polynomials
Xiaogang Liu
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In t…
Some results about permutation properties of a kind of binomials over finite fields
Xiaogang Liu
Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of…
Eigenvalues of Cayley graphs
Xiaogang Liu, Sanming Zhou
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of C…
On the -characteristic polynomial of a graph
Xiaogang Liu, Shunyi Liu
Let be a graph with vertices, and let and denote respectively the adjacency matrix and the degree matrix of . Define for any r…
Graphs determined by their -spectra
Huiqiu Lin, Xiaogang Liu, Jie Xue
Let be a graph with vertices, and let and denote respectively the adjacency matrix and the degree matrix of . Define for any r…
Quadratic unitary Cayley graphs of finite commutative rings
Xiaogang Liu, Sanming Zhou
The purpose of this paper is to study spectral properties of a family of Cayley graphs on finite commutative rings. Let be such a ring and its set of units. Let $Q_R…
On the Lower Bound of the Divisibility of Exponential Sums in Binomial Case
Xiaogang Liu
Francis Castro, et al [2] computed the exact divisibility of families of exponential sums associated to binomials over , and a conjecture…
Laplacian spectral characterization of dumbbell graphs and theta graphs
Xiaogang Liu, Pengli Lu
Let and denote the path and cycle on vertices respectively. The dumbbell graph, denoted by , is the graph obtained from two cycles , and a pat…
Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
Xiaogang Liu, Pengli Lu
Let be a graph with vertex set and edge set . The subdivision graph of a graph is the graph obtained by inserting a new vertex int…
Spectra of subdivision-vertex join and subdivision-edge join of two graphs
Xiaogang Liu, Zuhe Zhang
The subdivision graph of a graph is the graph obtained by inserting a new vertex into every edge of . Let and be two vertex disjoint graphs. The…
Spectra of the neighbourhood corona of two graphs
Xiaogang Liu, Sanming Zhou
Given simple graphs and , the neighbourhood corona of and , denoted , is the graph obtained by taking one copy of and copies of…
Laplacian spectral characterization of some double starlike trees
Pengli Lu, Xiaogang Liu
A tree is called double starlike if it has exactly two vertices of degree greater than two. Let denote the double starlike tree obtained by attaching pendant vertice…
Spectral characterizations of propeller graphs
Xiaogang Liu, Sanming Zhou
A propeller graph is obtained from an -graph by attaching a path to the vertex of degree four, where an -graph consists of two cycles with precisely one common vert…
Spectral properties of unitary Cayley graphs of finite commutative rings
Xiaogang Liu, Sanming Zhou
Let be a finite commutative ring. The unitary Cayley graph of , denoted , is the graph with vertex set and edge set , where $R^\t…
Laplacian spectral characterization of some graph products
Suijie Wang, Xiaogang Liu
This paper studies the Laplacian spectral characterization of some graph products. We consider a class of connected graphs: , and characterize all…