Abstract: Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for ...

ABSTRACT: Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matching equivalent graphs are ...

This repository contains programming tasks and solutions from the "Discrete Mathematics" course, with a focus on Graph Theory and Recursive Relations. The primary aim is to solve advanced problems in ...

ABSTRACT: Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matching equivalent graphs are ...

Abstract: This paper elaborates on the current situation and challenges of teaching discrete mathematics, pointing out that due to its high degree of abstraction, students often find it difficult to ...

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...