Chao Yang

According to our database, Chao Yang authored at least 11 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography.

Bing Yao, Chao Yang, Xia Liu, Fei Ma, Jing Su, Hui Sun, Xiaohui Zhang, Yarong Mu

CoRR, 2022

Topological Authentication Technique In Topologically Asymmetric Cryptosystem.

Bing Yao, Jing Su, Fei Ma, Hongyu Wang, Chao Yang

CoRR, 2022

2020

Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs.

Weihua Lu, Han Ren, Chao Yang

Discuss. Math. Graph Theory, 2020

2019

New formulae for the decycling number of graphs.

Han Ren, Chao Yang

Discuss. Math. Graph Theory, 2019

Using Chinese Characters To Generate Text-Based Passwords For Information Security.

Bing Yao, Yarong Mu, Yirong Sun, Hui Sun, Xiaohui Zhang, Hongyu Wang, Jing Su, Mingjun Zhang, Sihua Yang, Meimei Zhao, Xiaomin Wang, Fei Ma, Ming Yao, Chao Yang, Jianming Xie

CoRR, 2019

2018

A Note on Decycling Number, Vertex Partition and AVD-Total Coloring in Graphs.

Chao Yang, Han Ren, Erling Wei

Graphs Comb., 2018

Text-based Passwords Generated From Topological Graphic Passwords.

Bing Yao, Xiaohui Zhang, Hui Sun, Yarong Mu, Yirong Sun, Xiaomin Wang, Hongyu Wang, Fei Ma, Jing Su, Chao Yang, Sihua Yang, Mingjun Zhang

CoRR, 2018

Topological Graphic Passwords And Their Matchings Towards Cryptography.

Bing Yao, Hui Sun, Xiaohui Zhang, Yarong Mu, Yirong Sun, Hongyu Wang, Jing Su, Mingjun Zhang, Sihua Yang, Chao Yang

CoRR, 2018

2017

A new formula for the decycling number of regular graphs.

Han Ren, Chao Yang, Tian-xiao Zhao

Discret. Math., 2017

2016

A note on graph proper total colorings with many distinguishing constraints.

Chao Yang, Bing Yao, Han Ren

Inf. Process. Lett., 2016

Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.

Chao Yang, Han Ren, Bing Yao

Ars Comb., 2016