In this paper we propose formulas for the distance between vertices of a generalized Sierpiński graph 𝑆(𝐺, 𝑡) in terms of the distance between vertices of the base graph 𝐺. In particular, we ...

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, and ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...