| dc.contributor.advisor | Gregor, Petr | |
| dc.creator | Pfeiffer, Hayden | |
| dc.date.accessioned | 2024-04-08T08:47:29Z | |
| dc.date.available | 2024-04-08T08:47:29Z | |
| dc.date.issued | 2024 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11956/188613 | |
| dc.description.abstract | Title: Distance Magic Labelings Author: Hayden Pfeiffer Department: Dept. of Theoretical Computer Science and Mathematical Logic Supervisor: doc. Mgr. Petr Gregor, Ph.D., KTIML, MFF UK Abstract: A distance magic labeling of a graph G is a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that the sum of labels on the neighbourhood of each vertex is constant. A framework based on linear algebra has been developed using the notion of neighbour balance to determine whether there exists a distance magic labeling for a hypercube with dimension n. In this thesis, we extend this framework to all Cayley graphs on Zn 2 . We use this framework to reprove some known results from recent literature. We also use this framework to introduce the notion of component-wise distance magic labelings on Cayley graphs of Zn 2 . Keywords: distance magic labeling, Cayley graph, hypercube, neighbour balance iii | en_US |
| dc.language | English | cs_CZ |
| dc.language.iso | en_US | |
| dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
| dc.subject | distančně magické očíslování|Cayleyho graf|hyperkrychle | cs_CZ |
| dc.subject | distance magic labeling|Cayley graph|hypercube | en_US |
| dc.title | Distance magic labelings | en_US |
| dc.type | diplomová práce | cs_CZ |
| dcterms.created | 2024 | |
| dcterms.dateAccepted | 2024-02-16 | |
| dc.description.department | Department of Theoretical Computer Science and Mathematical Logic | en_US |
| dc.description.department | Katedra teoretické informatiky a matematické logiky | cs_CZ |
| dc.description.faculty | Faculty of Mathematics and Physics | en_US |
| dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
| dc.identifier.repId | 250229 | |
| dc.title.translated | Distančně magické očíslování | cs_CZ |
| dc.contributor.referee | Pangrác, Ondřej | |
| thesis.degree.name | Mgr. | |
| thesis.degree.level | navazující magisterské | cs_CZ |
| thesis.degree.discipline | Computer Science - Discrete Models and Algorithms | en_US |
| thesis.degree.discipline | Computer Science - Discrete Models and Algorithms | cs_CZ |
| thesis.degree.program | Computer Science - Discrete Models and Algorithms | en_US |
| thesis.degree.program | Computer Science - Discrete Models and Algorithms | cs_CZ |
| uk.thesis.type | diplomová práce | cs_CZ |
| uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra teoretické informatiky a matematické logiky | cs_CZ |
| uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Theoretical Computer Science and Mathematical Logic | en_US |
| uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
| uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
| uk.faculty-abbr.cs | MFF | cs_CZ |
| uk.degree-discipline.cs | Computer Science - Discrete Models and Algorithms | cs_CZ |
| uk.degree-discipline.en | Computer Science - Discrete Models and Algorithms | en_US |
| uk.degree-program.cs | Computer Science - Discrete Models and Algorithms | cs_CZ |
| uk.degree-program.en | Computer Science - Discrete Models and Algorithms | en_US |
| thesis.grade.cs | Velmi dobře | cs_CZ |
| thesis.grade.en | Very good | en_US |
| uk.abstract.en | Title: Distance Magic Labelings Author: Hayden Pfeiffer Department: Dept. of Theoretical Computer Science and Mathematical Logic Supervisor: doc. Mgr. Petr Gregor, Ph.D., KTIML, MFF UK Abstract: A distance magic labeling of a graph G is a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that the sum of labels on the neighbourhood of each vertex is constant. A framework based on linear algebra has been developed using the notion of neighbour balance to determine whether there exists a distance magic labeling for a hypercube with dimension n. In this thesis, we extend this framework to all Cayley graphs on Zn 2 . We use this framework to reprove some known results from recent literature. We also use this framework to introduce the notion of component-wise distance magic labelings on Cayley graphs of Zn 2 . Keywords: distance magic labeling, Cayley graph, hypercube, neighbour balance iii | en_US |
| uk.file-availability | V | |
| uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra teoretické informatiky a matematické logiky | cs_CZ |
| thesis.grade.code | 2 | |
| uk.publication-place | Praha | cs_CZ |
| uk.thesis.defenceStatus | O | |
