Expander graphs, isoperimetric numbers, and forwarding indices

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

Yu Qing Chen, Teng Fang, Sanming Zhou

2019-06-01

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..

The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals

Alice MW Hui, Muhammad Adib Surani, Sanming Zhou

2019-05-01

We derive upper and lower bounds for the vertex-isoperimetric number of the incidence graphs of unitals and determine its order of..

Cyclotomic graphs and perfect codes

Sanming Zhou

2019-03-01

We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of Z[ζm]/A, wit..

The isoperimetric number of the incidence graph of PG(n, q)

Andrew Elvey Price, Muhammad Adib Surani, Sanming Zhou

2018-08-10

Let Γn,q be the point-hyperplane incidence graph of the projective space PG(n, q), where n ≥ 2 is an integer and q a prime power. ..

RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS

DF Hsu, Sanming Zhou

2018-08-01

We prove the existence and give constructions of a-fold perfect resolvable-Mendelsohn design for any integers k\geq 2]]> with such..

Weak metacirculants of odd prime power order

Jin-Xin Zhou, Sanming Zhou

2018-04-01

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of the..

PERFECT CODES IN CAYLEY GRAPHS

He Huang, Binzhou Xia, Sanming Zhou

2018-01-01

Given a graph Γ, a subset C of V (Γ) is called a perfect code in Γ if every vertex of Γ is at distance no more than one to exactly..

Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks

Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou

2017-11-01

A graph Γ is called G-symmetric if it admits G as a group of automorphisms acting transitively on the set of ordered pairs of adja..

Perfect codes in circulant graphs

Rongquan Feng, He Huang, Sanming Zhou

2017-07-01

A perfect code in a graph Γ=(V,E) is a subset C of V that is an independent set such that every vertex in V∖C is adjacent to exact..

Radio number of trees

Devsi Bantva, Samir Vaidya, Sanming Zhou

2017-01-30

A radio labeling of a graph G is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|≥diam(G)+1−d(u,v) for every pair of distinct vert..

Recursive cubes of rings as models for interconnection networks

Hamid Mokhtar, Sanming Zhou

2017-01-30

We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the ..

Total perfect codes in Cayley graphs

Sanming Zhou

2016-12-01

A total perfect code in a graph Γ is a subset C of V(Γ) such that every vertex of Γ is adjacent to exactly one vertex in C. We giv..

Group distance magic and antimagic graphs

S Cichacz, D Froncek, K Sugeng, Sanming Zhou

2016-10-01

Given a graph G with n vertices and an Abelian group A of order n, an A-distance antimagic labelling of G is a bijection from V (G..

Tree Connectivities of Cayley Graphs on Abelian Groups with Small Degrees

Yuefang Sun, Sanming Zhou

2016-10-01

The generalized k-connectivity κk(G) and the generalized k-edge-connectivity λk(G) of a graph G, also known as the tree connectivi..

A linear-time algorithm for the orbit problem over cyclic groups

Anthony W Lin, Sanming Zhou

2016-08-01

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given c..

A family of symmetric graphs with complete quotients

Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou

2016-05-13

A finite graph Γ is G-symmetric if it admits G as a group of automorphisms acting transitively on V (Γ) and transitively on the se..

Forwarding and optical indices of 4-regular circulant networks

Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou

2015-11-01

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The l..

Three-arc graphs: Characterization and domination

Guangjun Xu, Sanming Zhou

2015-10-01

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are..

Quadratic unitary Cayley graphs of finite commutative rings

Xiaogang Liu, Sanming Zhou

2015-08-15

The purpose of this paper is to study spectral properties of a family of Cayley graphs on finite commutative rings. Let R be such ..

Linear and cyclic distance-three labellings of trees

Deborah King, Yang Li, Sanming Zhou

2014-12-11

Given a finite or infinite graph G and positive integers ℓ,h1, h2, h3, an L(h1, h2, h3)-labelling of G with span ℓ is a mapping f:..

Spectra of the neighbourhood corona of two graphs

Xiaogang Liu, Sanming Zhou

2014-09-02

Given simple graphs (Formula presented.) and (Formula presented.) , the neighbourhood corona of (Formula presented.) and (Formula ..

Hamiltonicity of 3-Arc Graphs

Guangjun Xu, Sanming Zhou

2014-09-01

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are..

Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes

Alison Thomson, Sanming Zhou

2014-05-01

A Frobenius group is a transitive but not regular permutation group such that only the identity element can fix two points. A fini..

SYMMETRIC GRAPHS WITH 2-ARC TRANSITIVE QUOTIENTS

Guangjun Xu, Sanming Zhou

2014-04-01

A graph Γ is G-symmetric if Γ admits G as a group of automorphisms acting transitively on the set of vertices and the set of arcs ..

Rotational circulant graphs

Alison Thomson, Sanming Zhou

2014-01-10

A Frobenius group is a transitive permutation group which is not regular but only the identity element can fix two points. Such a ..

Invariants Concerning f-Domination in Graphs

Sanming Zhou

2014-01-01

Given a graph G and a function f : V(G) → {0, 1,2,…}, a subset D of V(G) is called an f-dominating set of G if every vertex x outs..

SPECTRAL CHARACTERIZATIONS OF PROPELLER GRAPHS

Xiaogang Liu, Sanming Zhou

2014-01-01

A propeller graph is obtained from an ∞-graph by attaching a path to the vertex of degree four, where an ∞-graph consists of two c..

Unitary Graphs

Sanming Zhou

2014-01-01

Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the..

Unitary graphs and classification of a family of symmetric graphs with complete quotients

Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco, Sanming Zhou

2013-11-01

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

The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups

Xiangwen Li, Vicky Mak-Hau, Sanming Zhou

2013-05-01

A k-L(2,1)-labelling of a graph G is a mapping f:V(G)→{0,1,2,.,k} such that |f(u)-f(v)|≥2 if uvεE(G) and f(u)≠f(v) if u,v are dist..

Labeling outerplanar graphs with maximum degree three

Xiangwen Li, Sanming Zhou

2013-01-01

An L(2, 1)-labeling of a graph G is an assignment of a non-negative integer to each vertex of G such that adjacent vertices receiv..

Spectral properties of unitary Cayley graphs of finite commutative rings

Xiaogang Liu, Sanming Zhou

2012-10-25

Let R be a finite commutative ring. The unitary Cayley graph of R, denoted GR, is the graph with vertex set R and edge set where R..

Gossiping and routing in second-kind Frobenius graphs

Xin Gui Fang, Sanming Zhou

2012-08-01

A Frobenius group is a permutation group which is transitive but not regular such that only the identity element can fix two point..