Xuanlong Ma

activity

20152021

collaborators

7 papers

math.CO2021

Completeness-resolvable graphs

Min Feng, Xuanlong Ma, Huiling Xu

Given a connected graph $G = (V (G), E (G))$ , the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d (u, v)$ . For a proper subset $W$ of $V (G)$ , let $m (W)$ be t…

math.CO2020

The co-prime order graph associated with a finite group

Xuanlong Ma, Zhonghua Wang

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$ , and two distinct vertices $x, y$ are adjacent if gcd $(o (x), o (y))$ is either $1$ or a…

math.CO2020

Perfect codes in Cayley sum graphs

Xuanlong Ma, Kaishun Wang, Yuefeng Yang

A subset $C$ of the vertex set of a graph $Γ$ is called a perfect code of $Γ$ if every vertex of $Γ$ is at distance no more than one to exactly one vertex in $C$ . Let $A$ be a fini…

math.CO2017

Lambda number of the power graph of a finite group

Xuanlong Ma, Min Feng, Kaishun Wang

The power graph $Γ_{G}$ of a finite group $G$ is the graph with the vertex set $G$ , where two distinct elements are adjacent if one is a power of the other. An $L (2, 1)$ -labeling of…

math.GR2016

Finite groups with star-free noncyclic graphs

Xuanlong Ma, Gary L. Walls, Kaishun Wang

For a finite noncyclic group $G$ , let $\Cyc(G)$ be a set of elements $a$ of $G$ such that $⟨ a, b ⟩$ is cyclic for each $b$ of $G$ . The noncyclic graph of $G$ is a graph…

math.CO2015

On the spectra of strong power graphs of finite groups

Xuanlong Ma

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.