5 papers
On 2-distance-transitive circulant digraphs
Wei Jin, Cai Xia Li, Ping Shan Li +3
Circulant digraphs form a prominent class of Cayley digraphs defined on finite cyclic groups. Building on the existing classification of -arc-transitive circulant graphs, this p…
The cyclic diagnosability of Cayley graphs generated by transposition triangle-free unicyclic graphs under the PMC and MM* models
Jialu Ding, Caixia Li, Pingshan Li +1
Diagnosability is a critical parameter for evaluating the reliability and self-diagnostic capacity of multiprocessor systems. As an advanced extension of traditional diagnosability…
Classification of two-distance-transitive Cayley graphs of the semi-dihedral groups
Wei Jin, Cai Xia Li, Ping Shan Li
The class of 2-distance-transitive graphs naturally generalizes distance-transitive graphs and plays a central role in algebraic graph theory. Classifying such graphs for a prescri…
A note on the second-largest number of dissociation sets in connected graphs
Pingshan Li, Ke Yang, Wei Jin
A subset of vertices is called a dissociation set if it induces a subgraph with vertex degree at most one. Recently, Yuan et al. established the upper bound of the maximum number o…
A classification of two-distance-transitive Cayley graphs over the generalized quaternion groups
Wei Jin, Pingshan Li, Li Tan
A non-complete graph is \emph{-distance-transitive} if, for and for any two vertex pairs and with the same distance in the graph, there exist…