Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Ta Sheng Tan"'
Autor:
Ta Sheng Tan1, Wen Chean Teh2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2024, Vol. 26 Issue 3, p1-13. 13p.
Publikováno v:
Web of Science
The lazy cop number is the minimum number of cops needed for the cops to have a winning strategy in the game of Cops and Robber where at most one cop may move in any one round. This variant of the game of Cops and Robber, called Lazy Cops and Robber,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::712bf94c7592bef6d53a4e4039545c21
https://doi.org/10.11113/mjfas.v18n2.2235
https://doi.org/10.11113/mjfas.v18n2.2235
Let $f(x)=x^8+ax^4+b \in \mathbb{Q}[x]$ be an irreducible polynomial where $b$ is a square. We give a method that completely describes the factorization patterns of a linear resolvent of $f(x)$ using simple arithmetic conditions on $a$ and $b$. As a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3125c601f8ae8743a9a0958e56ed72a
http://arxiv.org/abs/2210.10257
http://arxiv.org/abs/2210.10257
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:3511-3521
An on-line Ramsey game is a game between two players, Builder and Painter, on an initially empty graph with unbounded set of vertices. In each round, Builder selects two vertices and joins them with an edge while Painter colours the edge immediately
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da3f052fe90515110aa7fdcfd094f61c
https://doi.org/10.1007/s40840-021-01130-x
https://doi.org/10.1007/s40840-021-01130-x
Autor:
Ta Sheng Tan, Wen Chean Teh
The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related to this graph parameter, which can be settled by showing that every t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf2e438ed28637d066bb3282ec645f78
Publikováno v:
Discrete Mathematics. 342:1186-1190
The classical Dirac’s theorem states that every graph G with order at least 3 and minimum degree δ ( G ) ≥ | G | 2 contains a Hamiltonian cycle. Let G be an edge-colored graph. A subgraph of an edge-colored graph is called rainbow if all its edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cf2f50274c1b067ad2032e38a72f93c
https://doi.org/10.1016/j.disc.2019.01.002
https://doi.org/10.1016/j.disc.2019.01.002
Publikováno v:
Discrete Mathematics. 341:2762-2767
The Ryser Conjecture which states that there is a transversal of size n in a Latin square of odd order n is equivalent to finding a rainbow matching of size n in a properly edge-colored K n , n using n colors when n is odd. Let δ be the minimum degr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5905b368b8e429195a1b63927506bf1
https://doi.org/10.1016/j.disc.2018.06.019
https://doi.org/10.1016/j.disc.2018.06.019
Publikováno v:
Discrete Mathematics. 344:112440
Given two simple graphs G and H, the Ramsey number R ( G , H ) is the smallest integer n such that for any graph of order n, either it contains G or its complement contains H. Let T n be a tree graph of order n and W s , m be the generalised wheel gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c428dc0ea57d4aad78c767ab52c8fb9
https://doi.org/10.1016/j.disc.2021.112440
https://doi.org/10.1016/j.disc.2021.112440
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 41:1657-1670
The burning number b(G) of a graph G is used for measuring the speed of contagion in a graph. In this paper, we study the burning number of the generalized Petersen graph P(n, k). We show that for any fixed positive integer k, $$\lim _{n\rightarrow \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35e93feea50611d2ac08e4800be4f16b
https://doi.org/10.1007/s40840-017-0585-6
https://doi.org/10.1007/s40840-017-0585-6
Publikováno v:
Discrete Mathematics. 340:1693-1704
The lazy cop number is the minimum number of cops needed for the cops to have a winning strategy in the game of Cops and Robbers where at most one cop may move in any round. This variant of the game of Cops and Robbers, called Lazy Cops and Robbers,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8b361edc0a59dc75df6e9af882d747c
https://doi.org/10.1016/j.disc.2016.09.031
https://doi.org/10.1016/j.disc.2016.09.031