default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanming Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j97]Devsi Bantva
, Samir Vaidya, Sanming Zhou:
Radio labelling of two-branch trees. Appl. Math. Comput. 487: 129097 (2025)- 2024
- [j96]Yuxuan Li, Binzhou Xia, Sanming Zhou, Wenying Zhu:
A Solution to Babai's Problems on Digraphs with Non-diagonalizable Adjacency Matrix. Comb. 44(1): 179-203 (2024) - [j95]Xiaomeng Wang, Lina Wei, Shou-Jun Xu, Sanming Zhou:
Subgroup total perfect codes in Cayley sum graphs. Des. Codes Cryptogr. 92(9): 2599-2613 (2024) - [j94]Yan-Li Qin, Binzhou Xia, Sanming Zhou:
Stability of graph pairs involving vertex-transitive graphs. Discret. Math. 347(4): 113856 (2024) - [j93]Junyang Zhang, Sanming Zhou:
Nowhere-zero 3-flows in Cayley graphs on supersolvable groups. J. Comb. Theory, Ser. A 204: 105852 (2024) - [j92]Yuxuan Li, Binzhou Xia, Sanming Zhou:
The second largest eigenvalue of normal Cayley graphs on symmetric groups generated by cycles. J. Comb. Theory, Ser. A 206: 105885 (2024) - 2023
- [j91]Yuxuan Li, Binzhou Xia, Sanming Zhou:
Aldous' spectral gap property for normal Cayley graphs on symmetric groups. Eur. J. Comb. 110: 103657 (2023) - 2022
- [j90]Xiaogang Liu, Sanming Zhou:
Eigenvalues of Cayley Graphs. Electron. J. Comb. 29(2) (2022) - [j89]Yanpeng Wang, Binzhou Xia, Sanming Zhou:
Subgroup regular sets in Cayley graphs. Discret. Math. 345(11): 113023 (2022) - [j88]Junyang Zhang, Sanming Zhou:
Corrigendum to "On subgroup perfect codes in Cayley graphs" [European J. Combin. 91 (2021) 103228]. Eur. J. Comb. 101: 103461 (2022) - [j87]Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou:
Nontrivial t-Intersecting Families for Vector Spaces. SIAM J. Discret. Math. 36(3): 1823-1847 (2022) - [j86]Tobias Edwards, Benjamin I. P. Rubinstein, Zuhe Zhang, Sanming Zhou:
A Graph Symmetrization Bound on Channel Information Leakage Under Blowfish Privacy. IEEE Trans. Inf. Theory 68(1): 538-548 (2022) - [i7]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio labelling of two-branch trees. CoRR abs/2201.12582 (2022) - 2021
- [j85]Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou:
Extremal even-cycle-free subgraphs of the complete transposition graphs. Appl. Math. Comput. 405: 126223 (2021) - [j84]Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou:
Perfect state transfer in NEPS of complete graphs. Discret. Appl. Math. 289: 98-114 (2021) - [j83]Anna Lladó, Hamid Mokhtar, Oriol Serra, Sanming Zhou:
Distance-constrained labellings of Cartesian products of graphs. Discret. Appl. Math. 304: 375-383 (2021) - [j82]Junyang Zhang, Sanming Zhou:
On subgroup perfect codes in Cayley graphs. Eur. J. Comb. 91: 103228 (2021) - [j81]Yan-Li Qin, Binzhou Xia, Jin-Xin Zhou, Sanming Zhou:
Stability of graph pairs. J. Comb. Theory B 147: 71-95 (2021) - [j80]Cai Heng Li, Binzhou Xia, Sanming Zhou:
An explicit characterization of arc-transitive circulants. J. Comb. Theory B 150: 1-16 (2021) - [j79]Yan-Li Qin, Binzhou Xia, Sanming Zhou:
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs. J. Graph Theory 97(1): 70-81 (2021) - 2020
- [j78]Xuanlong Ma, Gary L. Walls, Kaishun Wang, Sanming Zhou:
Subgroup Perfect Codes in Cayley Graphs. SIAM J. Discret. Math. 34(3): 1909-1921 (2020) - [i6]Tobias Edwards, Benjamin I. P. Rubinstein, Zuhe Zhang, Sanming Zhou:
A Graph Symmetrisation Bound on Channel Information Leakage under Blowfish Privacy. CoRR abs/2007.05975 (2020)
2010 – 2019
- 2019
- [j77]Alice M. W. Hui, Muhammad Adib Surani, Sanming Zhou:
The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals. Des. Codes Cryptogr. 87(5): 957-970 (2019) - [j76]Yu Qing Chen, Teng Fang, Sanming Zhou:
Affine flag graphs and classification of a family of symmetric graphs with complete quotients. Discret. Math. 342(6): 1792-1798 (2019) - [j75]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's conjecture for squares of 2-trees. Eur. J. Comb. 76: 159-174 (2019) - [j74]Yan-Li Qin, Binzhou Xia, Sanming Zhou:
Stability of circulant graphs. J. Comb. Theory B 136: 154-169 (2019) - 2018
- [j73]Andrew Elvey Price, Muhammad Adib Surani, Sanming Zhou:
The Isoperimetric Number of the Incidence Graph of PG(n, q). Electron. J. Comb. 25(3): 3 (2018) - [j72]Jin-Xin Zhou, Sanming Zhou:
Weak metacirculants of odd prime power order. J. Comb. Theory A 155: 225-243 (2018) - [j71]He Huang, Binzhou Xia, Sanming Zhou:
Perfect Codes in Cayley Graphs. SIAM J. Discret. Math. 32(1): 548-559 (2018) - 2017
- [j70]Shui Yu, Meng Liu, Wanchun Dou, Xiting Liu, Sanming Zhou:
Networking for Big Data: A Survey. IEEE Commun. Surv. Tutorials 19(1): 531-549 (2017) - [j69]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio number of trees. Discret. Appl. Math. 217: 110-122 (2017) - [j68]Hamid Mokhtar, Sanming Zhou:
Recursive cubes of rings as models for interconnection networks. Discret. Appl. Math. 217: 639-662 (2017) - [j67]Rongquan Feng, He Huang, Sanming Zhou:
Perfect codes in circulant graphs. Discret. Math. 340(7): 1522-1527 (2017) - [j66]Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou:
Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks. J. Comb. Theory A 152: 303-340 (2017) - [j65]Guangjun Xu, Sanming Zhou:
Hadwiger's Conjecture for the Complements of Kneser Graphs. J. Graph Theory 84(1): 5-16 (2017) - [j64]Oriol Serra, Jozef Sirán, Sanming Zhou:
Preface. J. Interconnect. Networks 17(3-4): 1702002:1-1702002:3 (2017) - 2016
- [j63]Anthony W. Lin, Sanming Zhou:
A linear-time algorithm for the orbit problem over cyclic groups. Acta Informatica 53(5): 493-508 (2016) - [j62]Xiangwen Li, Sanming Zhou:
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms. Ars Math. Contemp. 10(1): 85-90 (2016) - [j61]Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou:
A Family of Symmetric Graphs with Complete Quotients. Electron. J. Comb. 23(2): 2 (2016) - [j60]David Wood, Guangjun Xu, Sanming Zhou:
Hadwiger's Conjecture for 3-Arc Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j59]Sanming Zhou:
Total perfect codes in Cayley graphs. Des. Codes Cryptogr. 81(3): 489-504 (2016) - [j58]Ricky Rotheram, Sanming Zhou:
Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes. J. Graph Theory 81(4): 364-392 (2016) - [c2]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's Conjecture and Squares of Chordal Graphs. COCOON 2016: 417-428 - [i5]L. Sunil Chandran, Davis Issac, Sanming Zhou:
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. CoRR abs/1603.03205 (2016) - 2015
- [j57]Guangjun Xu, Sanming Zhou:
Three-arc graphs: Characterization and domination. Discret. Appl. Math. 193: 200-207 (2015) - [j56]Sylwia Cichacz, Dalibor Froncek, Kiki A. Sugeng, Sanming Zhou:
Group distance magic and antimagic graphs. Electron. Notes Discret. Math. 48: 41-48 (2015) - [j55]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio number of trees. Electron. Notes Discret. Math. 48: 135-141 (2015) - [j54]Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou:
Forwarding and optical indices of 4-regular circulant networks. J. Discrete Algorithms 35: 27-39 (2015) - [i4]Deborah King, Yang Li, Sanming Zhou:
Linear and cyclic distance-three labellings of trees. CTW 2015: 133-136 - [i3]Hamid Mokhtar, Sanming Zhou:
Recursive cube of rings. CTW 2015: 137-140 - [i2]Yukun Cheng, Sanming Zhou:
A Survey on Approximation Mechanism Design without Money for Facility Games. CoRR abs/1503.07426 (2015) - 2014
- [j53]Alison Thomson, Sanming Zhou:
Rotational circulant graphs. Discret. Appl. Math. 162: 296-305 (2014) - [j52]Deborah King, Yang Li, Sanming Zhou:
Linear and cyclic distance-three labellings of trees. Discret. Appl. Math. 178: 109-120 (2014) - [j51]Alison Thomson, Sanming Zhou:
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes. Eur. J. Comb. 38: 61-78 (2014) - [j50]Guangjun Xu, Sanming Zhou:
Hamiltonicity of 3-Arc Graphs. Graphs Comb. 30(5): 1283-1299 (2014) - [j49]Sanming Zhou:
Unitary Graphs. J. Graph Theory 75(1): 37-47 (2014) - [c1]Anthony Widjaja Lin, Sanming Zhou:
A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups. CONCUR 2014: 327-341 - [i1]Anthony Widjaja Lin, Sanming Zhou:
A linear time algorithm for the orbit problem over cyclic groups. CoRR abs/1411.3164 (2014) - 2013
- [j48]Xiangwen Li, Sanming Zhou:
Labeling outerplanar graphs with maximum degree three. Discret. Appl. Math. 161(1-2): 200-211 (2013) - [j47]Xiangwen Li, Vicky H. Mak-Hau, Sanming Zhou:
The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups. J. Comb. Optim. 25(4): 716-736 (2013) - 2012
- [j46]Xiaogang Liu, Sanming Zhou:
Spectral Properties of Unitary Cayley Graphs of Finite Commutative Rings. Electron. J. Comb. 19(4): 13 (2012) - [j45]Sanming Zhou:
On 4-valent Frobenius circulant graphs. Discret. Math. Theor. Comput. Sci. 14(2): 173-188 (2012) - [j44]Xin Gui Fang, Sanming Zhou:
Gossiping and routing in second-kind Frobenius graphs. Eur. J. Comb. 33(6): 1001-1014 (2012) - 2011
- [j43]Martin Knor, Guangjun Xu, Sanming Zhou:
A study of 3-arc graphs. Discret. Appl. Math. 159(5): 344-353 (2011) - 2010
- [j42]Xiangwen Li, Vicky H. Mak, Sanming Zhou:
Optimal radio labellings of complete m-ary trees. Discret. Appl. Math. 158(5): 507-515 (2010) - [j41]Martin Knor, Sanming Zhou:
Diameter and connectivity of 3-arc graphs. Discret. Math. 310(1): 37-42 (2010) - [j40]Cai Heng Li, Cheryl E. Praeger, Sanming Zhou:
Imprimitive symmetric graphs with cyclic blocks. Eur. J. Comb. 31(1): 362-367 (2010) - [j39]Deborah King, Charl J. Ras, Sanming Zhou:
The L(h, 1, 1)-labelling problem for trees. Eur. J. Comb. 31(5): 1295-1306 (2010) - [j38]Alison Thomson, Sanming Zhou:
Gossiping and routing in undirected triple-loop networks. Networks 55(4): 341-349 (2010)
2000 – 2009
- 2009
- [j37]Gerard J. Chang, Changhong Lu, Sanming Zhou:
Distance-two labellings of Hamming graphs. Discret. Appl. Math. 157(8): 1896-1904 (2009) - [j36]Sanming Zhou:
Minimum partition of an independence system into independent sets. Discret. Optim. 6(1): 125-133 (2009) - [j35]Sanming Zhou:
Classification of a family of symmetric graphs with complete 2-arc-transitive quotients. Discret. Math. 309(17): 5404-5410 (2009) - [j34]Sanming Zhou:
A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks. SIAM J. Discret. Math. 23(2): 694-714 (2009) - 2008
- [j33]Sanming Zhou:
A distance-labelling problem for hypercubes. Discret. Appl. Math. 156(15): 2846-2854 (2008) - [j32]Nicholas C. Wormald, Sanming Zhou:
Large forbidden trade volumes and edge packings of random graphs. Discret. Math. 308(13): 2751-2755 (2008) - [j31]Sanming Zhou:
On a class of finite symmetric graphs. Eur. J. Comb. 29(3): 630-640 (2008) - 2007
- [j30]Sanming Zhou:
Almost covers of 2-arc transitive graphs. Comb. 27(6): 745-746 (2007) - [j29]Gerard J. Chang, Changhong Lu, Sanming Zhou:
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. Discret. Math. 307(14): 1808-1817 (2007) - [j28]Sanming Zhou:
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey. Electron. Notes Discret. Math. 28: 527-534 (2007) - [j27]Jinjiang Yuan, Jian Ying Zhang, Sanming Zhou:
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem. J. Discrete Algorithms 5(3): 609-621 (2007) - [j26]Zaiping Lu, Sanming Zhou:
Finite symmetric graphs with two-arc transitive quotients II. J. Graph Theory 56(3): 167-193 (2007) - [j25]András Telcs, Nicholas C. Wormald, Sanming Zhou:
Hamiltonicity of random graphs produced by 2-processes. Random Struct. Algorithms 31(4): 450-481 (2007) - 2006
- [j24]Jian Ying Zhang, Zhi-Qiang Liu, Sanming Zhou:
Dynamic domination in fuzzy causal networks. IEEE Trans. Fuzzy Syst. 14(1): 42-57 (2006) - [j23]Sanming Zhou, Zhi-Qiang Liu, Jian Ying Zhang:
Fuzzy causal networks: general model, inference, and convergence. IEEE Trans. Fuzzy Syst. 14(3): 412-420 (2006) - 2005
- [j22]Mohammad A. Iranmanesh, Cheryl E. Praeger, Sanming Zhou:
Finite symmetric graphs with two-arc transitive quotients. J. Comb. Theory B 94(1): 79-99 (2005) - [j21]Sanming Zhou:
Labelling Cayley Graphs on Abelian Groups. SIAM J. Discret. Math. 19(4): 985-1003 (2005) - 2004
- [j20]Sanming Zhou:
Almost Covers Of 2-Arc Transitive Graphs. Comb. 24(4): 731-745 (2004) - [j19]Sanming Zhou:
A Gallai-type equality for the total domination number of a graph. Discuss. Math. Graph Theory 24(3): 539-543 (2004) - [j18]Jinjiang Yuan, Sanming Zhou:
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. J. Interconnect. Networks 5(2): 193-200 (2004) - [j17]Ladislav Stacho, Jozef Sirán, Sanming Zhou:
Routing balanced communications on hamilton decomposable networks. Parallel Process. Lett. 14(3-4): 377-385 (2004) - [j16]Sanming Zhou:
A channel assignment problem for optical networks modelled by Cayley graphs. Theor. Comput. Sci. 310(1-3): 501-511 (2004) - 2003
- [j15]Jian Ying Zhang, Zhi-Qiang Liu, Sanming Zhou:
Quotient FCMs-a decomposition theory for fuzzy cognitive maps. IEEE Trans. Fuzzy Syst. 11(5): 593-604 (2003) - 2002
- [j14]Sanming Zhou:
Imprimitive symmetric graphs, 3-arc graphs and 1-designs. Discret. Math. 244(1-3): 521-537 (2002) - [j13]Cai Heng Li, Cheryl E. Praeger, Akshay Venkatesh, Sanming Zhou:
Finite locally-quasiprimitive graphs. Discret. Math. 246(1-3): 197-218 (2002) - [j12]Man-Keung Siu, Zhongfu Zhang, Sanming Zhou:
An inequality between the diameter and the inverse dual degree of a tree. Discret. Math. 259(1-3): 351-358 (2002) - [j11]Sanming Zhou:
Constructing a Class of Symmetric Graphs. Eur. J. Comb. 23(6): 741-760 (2002) - [j10]Sheng Bau, Nicholas C. Wormald, Sanming Zhou:
Decycling numbers of random regular graphs. Random Struct. Algorithms 21(3-4): 397-413 (2002) - 2001
- [j9]Cai Heng Li, Sanming Zhou:
On Isomorphisms of Minimal Cayley Graphs and Digraphs. Graphs Comb. 17(2): 307-314 (2001) - 2000
- [j8]Sanming Zhou:
Bounding the bandwidths for graphs. Theor. Comput. Sci. 249(2): 357-368 (2000)
1990 – 1999
- 1999
- [j7]Beifang Chen, Sanming Zhou:
Domination number and neighbourhood conditions. Discret. Math. 195(1-3): 81-91 (1999) - [j6]Sanming Zhou:
A sequential coloring algorithm for finite sets. Discret. Math. 199(1-3): 291-297 (1999) - 1998
- [j5]Sanming Zhou, Jinjiang Yuan:
Harper-type lower bounds and the bandwidths of the compositions of graphs. Discret. Math. 181(1-3): 255-266 (1998) - [j4]Sanming Zhou:
Interpolation theorems for graphs, hypergraphs and matroids. Discret. Math. 185(1-3): 221-229 (1998) - [j3]Beifang Chen, Sanming Zhou:
Upper bounds for f-domination number of graphs, . Discret. Math. 185(1-3): 239-243 (1998) - 1995
- [j2]Sanming Zhou:
Matroid tree graphs and interpolation theorems. Discret. Math. 137(1-3): 395-397 (1995) - 1993
- [j1]Sanming Zhou:
Disjoint Hamiltonian cycles in fan 2k-type graphs. J. Graph Theory 17(6): 673-678 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
