| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Kockovni komplementi posplošenih Fibonaccijevih kock : na enovitem študijskem programu Predmetni učitelj, usmeritev izobraževalna matematika
Authors:ID Zobovič, Andrej (Author)
ID Vesel, Aleksander (Mentor) More about this mentor... New window
Files:.pdf EMAG_Zobovic_Andrej_2025.pdf (1,35 MB)
MD5: 434118799633FCA42149B8BD2CA2DCBE
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrskem delu preučujemo kockovne komplemente posplošenih Fibonaccijevih kock Q_h^C(f). Ti grafi nastanejo tako, da najprej iz hiperkocke Q_h odstranimo vsa vozlišča, ki vsebujejo niz f. Ce je G induciran podgraf od Q_h, potem je kockovni komplement grafa G graf, induciran z množico vozlišč grafa Q_h, ki niso v G. Kockovni komplement posplošene Fibonaccijeve kocke je tako podgraf od Q_h, induciran z množico vseh vozlišč, ki vsebujejo niz f. Osrednji del magistrskega dela je namenjen analizi povezanosti teh grafov. Z upoštevanjem struktur binarnih nizov, kot je parameter simetrije r(f) in podobnost začetka in konca niza π(f), podamo pogoje, pod katerimi so ti grafi povezani ali nepovezani. V nadaljevanju nas zanima tudi, kdaj ti grafi zadoščajo pogojem za delne kocke in medianske grafe, kar raziskujemo z uporabo teorije marjetičnih kock ter ustreznih karakterizacij.
Keywords:posplošena Fibonaccijeva kocka, Fibonaccijeva kocka, kockovni komplement, hiperkocka, binarni niz, delna kocka, medianski graf, graf, povezanost grafov, Hammingova razdalja
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[A. Zobovič]
Year of publishing:2025
Number of pages:VIII, 46 str.
PID:20.500.12556/DKUM-92925 New window
UDC:519.17(043.2)
COBISS.SI-ID:239926019 New window
Publication date in DKUM:19.06.2025
Views:171
Downloads:32
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:26.05.2025

Secondary language

Language:English
Title:Cube-Complements of generalized Fibonacci cubes : magistrsko delo
Abstract:In this master’s thesis, we study cube complements of generalized Fibonacci cubes Q_h^C(f). These graphs are obtained from the hypercube Q_h by removing all vertices that contain the string f. If G is an induced subgraph of Q_h, then the cube complement of graph G is the graph induced by the vertices of Q_h that are not in G. The cube complement for the generalized Fibonacci cube is thus the subgraph of Q_h induced by the set of all vertices that contain the string f. The main part of the master’s thesis is devoted to analyzing the connectivity of such graphs. Using the structure of binary strings, particularly the symmetry parameter r(f) and the similarity of the prefix and suffix π(f), we establish conditions under which these graphs are connected or disconnected. Furthermore, we investigate when these graphs satisfy the conditions for being partial cubes or median graphs, based on the theory of daisy cubes and the corresponding characterizations.
Keywords:generalized Fibonacci cube, Fibonacci cube, cube complement, hypercube, binary string, partial cube, median graph, graph, graph connectivity, Hamming distance


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica