Discrete Mathematics and Algorithms research pageThe Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between ...

Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify ...

Algorithms (2019). [4] Homomorphisms and colourings of oriented graphs: An updated survey. Discrete Mathematics (2016). Back to "Combinatorics and Discrete Mathematics" ...

xviii, 556 pages : 32 cm "This is a cultural history of mathematics and art, from antiquity to the present. Mathematicians and artists have long been on a quest to understand the physical world they ...

We consider a discrete search problem to detect a hidden target on one of the M M -intersected real lines at the origin. The target position is a vector of independent random variables with a known ...

Let G G be a simple connected graph. The first Zagreb index denoted by M 1(G) M 1 (G) is defined as M 1(G) = ∑u∈V d(u)2 M 1 (G) = ∑ u ∈ V d (u) 2. We present a lower bound for M 1(G) M 1 (G) in terms ...