Sanming Zhou

Distance-constrained labellings of Cartesian products of graphs

Anna Llado, Hamid Mokhtar, Oriol Serra, Sanming Zhou

Journal article  |  2021  |  DISCRETE APPLIED MATHEMATICS

An L(h1,h2,…,hl)-labelling of a graph G is a mapping ϕ:V(G)→{0,1,2,…} such that for 1≤i≤l and each pair of vertices u,v of G at di..

CLASSIFICATION OF TETRAVALENT 2-TRANSITIVE NONNORMAL CAYLEY GRAPHS OF FINITE SIMPLE GROUPS

Xin Gui Fang, Jie Wang, Sanming Zhou

Journal article  |  2021  |  BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY

A graph Γ is called (G, s)-arc-transitive if G ≤ Aut(Γ) is transitive on the set of vertices of Γ and the set of s-arcs of Γ, wher..

Extremal even-cycle-free subgraphs of the complete transposition graphs

Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou

Journal article  |  2021  |  APPLIED MATHEMATICS AND COMPUTATION

Given graphs G and H, the generalized Turán number ex(G,H) is the maximum number of edges in an H-free subgraph of G. In this pape..

An explicit characterization of arc-transitive circulants

Cai Heng Li, Binzhou Xia, Sanming Zhou

Journal article  |  2021  |  JOURNAL OF COMBINATORIAL THEORY SERIES B

A reductive characterization of arc-transitive circulants was given independently by Kovács in 2004 and the first author in 2005. ..

Stability of graph p airs

Yan-Li Qin, Binzhou Xia, Jin-Xin Zhou, Sanming Zhou

Journal article  |  2021  |  JOURNAL OF COMBINATORIAL THEORY SERIES B

We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of ..

Perfect state transfer in NEPS of complete graphs

Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou

Journal article  |  2021  |  DISCRETE APPLIED MATHEMATICS

Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph G with adjacency m..

On subgroup perfect codes in Cayley graphs

Junyang Zhang, Sanming Zhou

Journal article  |  2021  |  EUROPEAN JOURNAL OF COMBINATORICS

A perfect code in a graph Γ=(V,E) is a subset C of V such that no two vertices in C are adjacent and every vertex in V∖C is adjace..

Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs

Yan-Li Qin, Binzhou Xia, Sanming Zhou

Journal article  |  2020  |  JOURNAL OF GRAPH THEORY

The canonical double cover (Formula presented.) of a graph (Formula presented.) is the direct product of (Formula presented.) and ..

SUBGROUP PERFECT CODES IN CAYLEY GRAPHS

Xuanlong Ma, Gary L Walls, Kaishun Wang, Sanming Zhou

Journal article  |  2020  |  SIAM JOURNAL ON DISCRETE MATHEMATICS

Let Γ be a graph with vertex set V (Γ). A subset C of V (Γ) is called a perfect code in Γ if C is an independent set of Γ and ever..

Afflne flag graphs and classification of a family of symmetric graphs with complete quotients

Yu Qing Chen, Teng Fang, Sanming Zhou

Journal article  |  2019  |  DISCRETE MATHEMATICS

A graph Γ is G-symmetric if G is a group of automorphisms of Γ which is transitive on the set of ordered pairs of adjacent vertice..