https://www.um.edu.mt/library/oar/handle/123456789/36356 2026-04-23T22:38:08Z 2026-04-23T22:38:08Z https://www.um.edu.mt/library/oar/handle/123456789/24443 2017-12-12T02:37:21Z 2004-01-01T00:00:00Z

Title: The maths test Abstract: In the Maths test. .. I will try and do my best Even though I'm scared to death About Gaussian might forget In the Maths test. .. I will give it my best shot Hope I don't forget the rules Remeluber the ones that scare me and you

2004-01-01T00:00:00Z https://www.um.edu.mt/library/oar/handle/123456789/24442 2019-05-20T09:43:23Z 2004-01-01T00:00:00Z

Title: The Collection IX Editors: Sciriha, Irene; Walker, Ian G. Abstract: Ninth issue of The Collection, a journal by the Department of Mathematics at the University of Malta.

2004-01-01T00:00:00Z https://www.um.edu.mt/library/oar/handle/123456789/24441 2017-12-12T02:37:37Z 2004-01-01T00:00:00Z

Title: The eigenvalues of self-complementary graphs Abstract: Self complementary graphs have many interesting properties with reference to their main and non-main eigcnvalues. Eigenvalues are a special set of scalars associated with a linear system of equations (i.e., a matrix cquation) that are sometimes also known as characteristic roots, proper values, or latent. roots. We consider the spectra of self complementary graphs.

2004-01-01T00:00:00Z https://www.um.edu.mt/library/oar/handle/123456789/24439 2017-12-12T02:37:26Z 2004-01-01T00:00:00Z

Title: Powers of the adjacency matrix and the walk matrix Abstract: The aim of this article is to identify and prove various relations between powers of adjacency matrices of graphs and various invariant properties of graphs, in particular distance, diameter and bipartiteness. A relation between the walk matrix of a graph and a subset of the cigenvectors of the graph will also be illustrated. A number of Mathematica procedures are also provided which implement the results described. Note that the procedures are only illustrative; issues of algorithmic efficiency are largely ignored. Unless specified, all graphs are assumed to be simple and connected, that is, there is at most one edge between each pair of vertices, there are no loops, and there is at least one path between every two vertices. The adjacency matrix A or A(G) of a graph G having vertex set V = V(G) = {1, ... , n} is an n x n symmetric: matrix aij such that aij = 1 if vertices i and j are adjacent and 0 otherwise.

2004-01-01T00:00:00Z