The following pages link to Sanming Zhou (Q201997):
Displayed 50 items.
- A family of symmetric graphs with complete quotients (Q286104) (← links)
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Unitary graphs and classification of a family of symmetric graphs with complete quotients (Q372842) (← links)
- Gossiping and routing in second-kind Frobenius graphs (Q427787) (← links)
- Invariants concerning \(f\)-domination in graphs (Q472660) (← links)
- Recursive cubes of rings as models for interconnection networks (Q516899) (← links)
- Perfect codes in circulant graphs (Q526235) (← links)
- A study of 3-arc graphs (Q628319) (← links)
- Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal (Q659590) (← links)
- Hadwiger's conjecture for 3-arc graphs (Q727197) (← links)
- Rotational circulant graphs (Q741752) (← links)
- Hamiltonicity of 3-arc graphs (Q742645) (← links)
- (Q794407) (redirect page) (← links)
- An approach for combining the Ritz-Galerkin and finite element method (Q794408) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Forwarding and optical indices of 4-regular circulant networks (Q891819) (← links)
- Distance labellings of Cayley graphs of semigroups (Q906971) (← links)
- Large forbidden trade volumes and edge packings of random graphs (Q924957) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Imprimitive symmetric graphs with cyclic blocks (Q1041211) (← links)
- Classification of a family of symmetric graphs with complete 2-arc-transitive quotients (Q1044906) (← links)
- Diameter and connectivity of 3-arc graphs (Q1045140) (← links)
- Domination number and neighbourhood conditions (Q1296973) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Matroid tree graphs and interpolation theorems (Q1343812) (← links)
- Finite locally-quasiprimitive graphs (Q1348147) (← links)
- Imprimitive symmetric graphs, 3-arc graphs and 1-designs (Q1349118) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
- Symmetric graphs and flag graphs (Q1396723) (← links)
- (Q1583540) (redirect page) (← links)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Interpolation theorems for graphs, hypergraphs and matroids (Q1584241) (← links)
- Upper bounds for \(f\)-domination number of graphs (Q1584247) (← links)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- Hadwiger's conjecture for squares of 2-trees (Q1633613) (← links)
- The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) (Q1658768) (← links)
- Weak metacirculants of odd prime power order (Q1689042) (← links)
- Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs (Q1759329) (← links)
- Cayley graphs of order \(30p\) are Hamiltonian (Q1759403) (← links)
- Labeling outerplanar graphs with maximum degree three (Q1759878) (← links)
- On amply regular locally \(GQ(4, 6)\)-graphs (Q1761016) (← links)
- Finite symmetric graphs with two-arc transitive quotients (Q1775894) (← links)
- Weight distribution of the bases of a binary matroid (Q1808570) (← links)
- Constructing a class of symmetric graphs (Q1864588) (← links)
- A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990) (← links)