583 citations
- Central China Normal UniversityCN10 papers
- Chinese Academy of SciencesCN9 papers
- Institute of Theoretical PhysicsCN8 papers
- University of Hong KongHK7 papers
- Huazhong University of Science and TechnologyCN4 papers
- Hubei University for NationalitiesCN4 papers
- Southern University of Science and TechnologyCN4 papers
- University of Chinese Academy of SciencesCN4 papers
- Wuhan UniversityCN4 papers
- Beijing Normal UniversityCN3 papers
- Chinese University of Hong KongHK3 papers
- Graz University of TechnologyAT3 papers
5 papers · 1 filter
Anti-Ramsey problems in the generalized Petersen graphs for cycles
Huiqing Liu, Mei Lu, Shunzhe Zhang
The anti-Ramsey number is the maximum number of colors in an edge-coloring of with no rainbow copy of . In this paper, we determine the exact anti-Ramsey number in…
Burning numbers of t-unicyclic graphs
Ruiting Zhang, Yingying Yu, Huiqing Liu
Given a graph , the burning number of is the smallest integer for which there are vertices such that is a burning sequence o…
On the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequence along squares
Zhimin Sun, Arne Winterhof
Automatic sequences such as the Thue-Morse sequence and the Rudin-Shapiro sequence are highly predictable and thus not suitable in cryptography. In particular, they have small expa…
Average degrees of edge-chromatic critical graphs
Yan Cao, Guantao Chen, Suyun Jiang +2
Given a graph , denote by , and the maximum degree, the average degree and the chromatic index of , respectively. A simple graph is called {\it ed…
On the abelian complexity of the Rudin-Shapiro sequence
Xiaotao Lü, Jin Chen, Zhixiong Wen +1
In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function whic…