1 citations · 1 across the 8 of their papers we have counts for
11 papers · 1 filter
Extremal Trees With Prescribed Burning Numbers
Eugene Jun Tong Leong, Kai An Sim, Wen Chean Teh
Graph burning is motivated by the spread of social influence, and the burning number measures the speed of the spread. Given that the smallest burning number among the spanning tre…
Ternary is Still Good for Parikh Matrices
Robert Mercaş, Wen Chean Teh
The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 202…
A Note on Graph Burning of Path Forests
Ta Sheng Tan, Wen Chean Teh
Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the…
Counting Subwords in Circular Words and Their Parikh Matrices
Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A consid…
Ranks of Strictly Minimal Reaction Systems Induced by Permutations and Cartesian Product
Wen Chean Teh, Kien Trung Nguyen, Chuei Yee Chen
Reaction system is a computing model inspired by the biochemical interaction taking place within the living cells. Various extended or modified frameworks motivated by biological,…
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
Ta Sheng Tan, Wen Chean Teh
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorith…