Integral graphs

A tétel rövid nézete
dc.contributor.advisorTengely, Szabolcs
dc.contributor.authorMayala Lutome, Patrick
dc.contributor.departmentDE--Természettudományi és Technológiai Kar--Matematikai Intézethu_HU
dc.date.accessioned2020-05-14T08:17:47Z
dc.date.available2020-05-14T08:17:47Z
dc.date.created2020-05-08
dc.description.abstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this thesis, we define some graph operations which when applied on integral graphs generate other integral graphs. Also we present the relationship between integral trees of diameter 3 and Pell's equation and give a new theorem on its generalisation for constructing infinite families of integral trees of diameter 3. Furthermore, we present some characterisation of families of integral trees with even diameter and odd diameter.hu_HU
dc.description.correctorhbk
dc.description.courseApplied Mathematicshu_HU
dc.description.degreeMSc/MAhu_HU
dc.format.extent40hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/287178
dc.language.isoenhu_HU
dc.subjectIntegral graphhu_HU
dc.subjectEigenvalueshu_HU
dc.subjectIntegral treeshu_HU
dc.subjectadjacency matrixhu_HU
dc.subjectdiameterhu_HU
dc.subject.dspaceDEENK Témalista::Matematikahu_HU
dc.titleIntegral graphshu_HU
Fájlok
Gyűjtemények
Theses (Faculty of Science and Technology)