ABSTRACT: Let G be a graph and A=(aij)n×n be the adjacency matrix of G, the eigenvalues of A are said to be the eigenvalues of the graph G, and to form the spectrum of this graph. The numbers of ...

Taiwanese Journal of Mathematics, Vol. 22, No. 1 (February 2018), pp. 1-15 (15 pages) A. A. Abueida and M. Daven, Multidesigns for graph-pairs of order 4 and 5 ...

Applicable Analysis and Discrete Mathematics, Vol. 17, No. 2 (October, 2023), pp. 321-333 (13 pages) In this paper the problem of the existence of regular nut graphs is addressed. A generalization of ...

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 BSc in Data Science, BSc in Mathematics and Economics, BSc in Mathematics with Data Science, BSc in Mathematics with Economics, BSc in Mathematics, Statistics and ...

ABSTRACT: The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper we show the expression of the nullity and nullity set of unicyclic graphs with n vertices and ...