232 citations
- University of DelhiIN8 papers
- Multimedia UniversityMY4 papers
- Ruhr University BochumDE3 papers
- University College LondonGB3 papers
- University of MalayaMY3 papers
- University of OxfordGB3 papers
- American University of SharjahAE2 papers
- Argonne National LaboratoryUS2 papers
- Baruch CollegeUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Delft University of TechnologyNL2 papers
- East China Normal UniversityCN2 papers
5 papers · 1 filter
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…
Some Results On Spectrum And Energy Of Graphs With Loops
Saieed Akbari, Hussah Al Menderj, Miin Huey Ang +2
Let be a graph with loops obtained from a graph of order and loops at . In this paper, we establish a neccesary and sufficient condition on the bipa…
Parikh Matrices for Powers of Words
Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes th…
Parikh Matrices and Strong M-Equivalence
Wen Chean Teh
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. S…
Ramsey Algebras
Wen Chean Teh
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman'…