Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

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

Discrete Mathematics 323. (2014): 81-83. Print. * Wenger, Paul S. "Fractional Acquisition in Graphs." Discrete Applied Mathematics 178. (2014): 142-148. Print. * Published Conference Proceedings ...

P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...

Applicable Analysis and Discrete Mathematics, Vol. 7, No. 2 (October 2013), pp. 262-274 (13 pages) A map f : V → {0, 1, 2} is a Roman dominating function for G if for every vertex v with f(v) = 0, ...

It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...

Our mathematics courses introduce students to the disciplines of theoretical and applied mathematics, from theoretical courses in analysis and algebra to applied courses such as Ordinary Differential ...