| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 4 / 4
First pagePrevious page1Next pageLast page
1.
2.
On the Fibonacci dimension of partial cubes
Aleksander Vesel, 2009

Abstract: The Fibonacci dimension fdim▫$(G)$▫ of a graph ▫$G$▫ was introduced in [S. Cabello, D. Eppstein and S. Klavžar, The Fibonacci dimension of a graph, submitted] as the smallest integer ▫$d$▫ such that $G$ admits an isometric embedding into ▫$Q_d$▫, the ▫$d$▫-dimensional Fibonacci cube. A somewhat new combinatorial characterization of the Fibonacci dimension is given, which enables more comfortable proofs of some previously known results. In the second part of the paper the Fibonacci dimension of the resonance graphs of catacondensed benzenoid systems is studied. This study is inspired by the fact, that the Fibonacci cubes are precisely the resonance graphs of a subclass of the catacondensed benzenoid systems. The main result shows that the Fibonacci dimension of the resonance graph of a catacondensed benzenoid system ▫$G$▫ depends on the inner dual of ▫$G$▫. Moreover, we show that computing the Fibonacci dimension can be done in linear time for a graph of this class.
Keywords: matematika, teorija grafov, Fibonaccijeva dimenzija, delne kocke, resonančni grafi, benzenoidni sistemi, mathematics, graph theory, Fibonacci dimension, partial cubes, resonance graphs, benzenoid systems
Published: 10.07.2015; Views: 312; Downloads: 13
URL Link to full text

3.
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
Aleksander Vesel, 2013, original scientific article

Abstract: The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstein, S. Klavžar, The Fibonacci dimension of a graph Electron. J. Combin., 18 (2011) P 55, 23 pp] as the smallest integer ▫$d$▫ such that ▫$G$▫ admits an isometric embedding into ▫$Gamma_d$▫, the ▫$d$▫-dimensional Fibonacci cube. The Fibonacci dimension of the resonance graphs of catacondensed benzenoid systems is studied. This study is inspired by the fact, that the Fibonacci cubes are precisely the resonance graphs of a subclass of the catacondensed benzenoid systems. Our results show that the Fibonacci dimension of the resonance graph of a catacondensed benzenoid system ▫$G$▫ depends on the inner dual of ▫$G$▫. Moreover, we show that computing the Fibonacci dimension can be done in linear time for a graph of this class.
Keywords: Fibonaccijeva dimenzija, benzenoidni sistemi, resonančni grafi, algoritem, Fibonacci dimension, benzenoid systems, resonance graphs, algorithm
Published: 10.07.2015; Views: 331; Downloads: 26
URL Link to full text

4.
Strukturne lastnosti resonančnih grafov tubulenov in fulerenov
Niko Tratnik, 2017, doctoral dissertation

Abstract: Doktorska disertacija obravnava predvsem resonančne grafe tubulenov in fulerenov. V prvem poglavju so predstavljeni nekateri že znani rezultati o resonančnih grafih, prav tako pa je podana struktura doktorske disertacije. V naslednjem poglavju so definirani nekateri osnovni pojmi teorije grafov, ki jih potrebujemo v preostalih poglavjih. V tretjem poglavju so predstavljene tri pomembne družine kemijskih struktur, to so benzenoidni sistemi, tubuleni in fulereni. Omenjene družine predstavljajo molekule, ki jih imenujemo benzenoidni ogljikovodiki, ogljikove nanocevke in fulereni. V četrtem poglavju je najprej pokazana povezava med Kekuléjevimi strukturami določene molekule ter popolnimi prirejanji ustreznega kemijskega grafa. V nadaljevanju poglavja je definiran resonančni graf benzenoidnega sistema, tubulena in fulerena. Glavni namen tega koncepta je modeliranje interakcij med posameznimi Kekuléjevimi strukturami molekule. Nato se lotimo raziskovanja osnovnih lastnosti resonančnih grafov. Pokazano je, da je resonančni graf tubulena ali fulerena dvodelni graf, vsaka njegova povezana komponenta pa je bodisi pot bodisi graf z ožino štiri. Prav tako dokažemo, da je 2-jedro vsake povezane komponente resonančnega grafa širokega tubulena ali fulerena, ki ni pot, vedno 2-povezan graf. Nato podamo primer neskončne družine tubulenov, katerih resonančni grafi niso povezani. Na koncu poglavja definiramo resonančni graf za katerikoli graf, ki je vložen na zaprto ploskev. Dokažemo tudi, da so taki resonančni grafi inducirani podgrafi hiperkock. V petem poglavju definiramo Zhang-Zhangov polinom, ki je namenjen štetju posebnih struktur, imenovanih Clarova pokritja. Dokazano je, da je Zhang-Zhangov polinom grafa, vloženega na zaprto ploskev, enak polinomu kock ustreznega resonančnega grafa. Ta rezultat posplošuje podobne rezultate za benzenoidne sisteme, tubulene in fulerene. Na koncu se ukvarjamo s strukturo distributivne mreže resonančnih grafov. Dokazano je, da je vsaka povezana komponenta resonančnega grafa tubulena graf pokritja neke distributivne mreže. Prav tako pokažemo, da je vsaka povezana komponenta resonančnega grafa tubulena medianski graf, njen graf blokov pa je pot. Nazadnje podamo primer fulerena, katerega resonančni graf ni graf pokritja nobene distributivne mreže.
Keywords: benzenoidni sistem, ogljikova nanocevka, tubulen, fuleren, resonančni graf, Z-transformirani graf, Clarovo pokritje, Zhang-Zhangov polinom, polinom kock, distributivna mreža, medianski graf, graf blokov, grafi na ploskvah
Published: 09.01.2018; Views: 441; Downloads: 93
.pdf Full text (1,40 MB)

Search done in 0.1 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica