20 citations · 119 across the 28 of their papers we have counts for
28 papers
On the existence of neutral graph
Fei Ma
Graph is considered neutral if its assortativity coefficient is equal to zero. In this paper, we address an outstanding conjecture, i.e., whether is there a neutral graph on $n…
Topological Structures of Sets and their Subsets
Fei Ma, Bing Yao
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods…
Assortativity in networks
Fei Ma
The degree-degree correlation is crucial in understanding the structural properties of and dynamics occurring upon network, and is often measured by the assortativity coefficient $…
Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography
Bing Yao, Chao Yang, Xia Liu +5
We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, intege…
Parameterized Colorings And Labellings Of Graphs In Topological Coding
Bing Yao, Xiaohui Zhang, Hui Sun +3
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and fut…
Topological Authentication Technique In Topologically Asymmetric Cryptosystem
Bing Yao, Jing Su, Fei Ma +2
Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation,…