7 papers
Graphs attaining an upper bound on the mixed metric dimension
Shi Chen, Xuanlong Ma
Given a graph , we show that the mixed metric dimension of is exactly if and only if is either a cactus graph in which every cycle has precisely one vert…
On the mixed metric dimension of -connected graphs
Shi Chen, Xuanlong Ma
We show that for a -connected graph which is not a cycle, the mixed metric dimension of is at most , where is the cyclomatic number of . As an immediate…
The diameter and dominating sets of the difference graph of a nilpotent group
Xuanlong Ma, Samir Zahirović, Katarina Žigerović
Given a finite group , the difference graph of , denoted by , is the difference of the enhanced power graph of and the power graph of , with all isolat…
On finite groups whose coprime graph is a divisor graph
Xuanlong Ma, Liangliang Zhai, Nan Gao +1
In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs…
(Total) Perfect codes in (extended) subgroup sum graphs
Xuanlong Ma, Yuefeng Yang, Liangliang Zhai
Given a finite group with identity and a normal subgroup of , the subgroup sum graph (resp. extended subgroup sum graph ) of with respect to…
Forbidden subgraphs on conjugacy class graphs of groups
Papi Ray, Sonakshee Arora, Xuanlong Ma
Let be a finite group. The commuting (resp. nilpotent) conjugacy class graph (resp. ) of is a simple graph whose vertex set consists of all non-cen…
Perfect codes in 2-valent Cayley digraphs on abelian groups
Shilong Yu, Yuefeng Yang, Yushuang Fan +1
For a digraph , a subset of is a perfect code if is a dominating set such that every vertex of is dominated by exactly one vertex in . In this paper, we cl…