Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Some remarks on Balaban and sum-Balaban index
Martin Knor, Jozef Komorník, Riste Škrekovski, Aleksandra Tepeh, 2020, izvirni znanstveni članek

Opis: In the paper we study maximal values of Balaban and sum-Balaban index, and correct some results appearing in the literature which are only partially correct. Henceforth, we were able to solve a conjecture of M. Aouchiche, G. Caporossi and P. Hansen regarding the comparison of Balaban and Randić index. In addition, we showed that for every k and large enough n, the first k graphs of order n with the largest value of Balaban index are trees. We conclude the paper with a result about the accumulation points of sum-Balaban index.
Ključne besede: topological index, Balaban index, sum-Balaban index, Randić index
Objavljeno v RUP: 03.01.2022; Ogledov: 902; Prenosov: 21
.pdf Celotno besedilo (310,27 KB)

2.
On a conjecture about the ratio of Wiener index in iterated line graphs
Katarína Hriňáková, Martin Knor, Riste Škrekovski, 2018, izvirni znanstveni članek

Ključne besede: Wiener index, line graph, tree, iterated line graph
Objavljeno v RUP: 03.01.2022; Ogledov: 1032; Prenosov: 24
.pdf Celotno besedilo (391,35 KB)

3.
4.
A note on acyclic number of planar graphs
Mirko Petruševski, Riste Škrekovski, 2017, izvirni znanstveni članek

Opis: The acyclic number ▫$a(G)$▫ of a graph ▫$G$▫ is the maximum order of an induced forest in ▫$G$▫. The purpose of this short paper is to propose a conjecture that ▫$a(G)\geq \left( 1-\frac{3}{2g}\right)n$▫ holds for every planar graph ▫$G$▫ of girth ▫$g$▫ and order ▫$n$▫, which captures three known conjectures on the topic. In support of this conjecture, we prove a weaker result that ▫$a(G)\geq \left( 1-\frac{3}{g} \right)n$▫ holds. In addition, we give a construction showing that the constant ▫$\frac{3}{2}$▫ from the conjecture cannot be decreased.
Ključne besede: induced forest, acyclic number, planar graph, girth
Objavljeno v RUP: 03.01.2022; Ogledov: 895; Prenosov: 16
.pdf Celotno besedilo (227,50 KB)

5.
Relative edge betweenness centrality
Damir Vukičević, Riste Škrekovski, Aleksandra Tepeh, 2017, izvirni znanstveni članek

Opis: We introduce a new edge centrality measure - relative edge betweenness ▫$\gamma (uv) = b(uv)/\sqrt{c(u)c(v)}$▫, where ▫$b(uv$)▫ is the standard edge betweenness and ▫$c(u)$▫ is the adjusted vertex betweenness. In this alternative definition, the importance of an edge is normalized with respect to the importance of its end-vertices. This gives a better presentation of the ''local'' importance of an edge, i.e. its importance in the near neighborhood. We present sharp upper and lower bounds on this invariant together with the characterization of graphs attaining these bounds. In addition, we discuss the bounds for various interesting graph families, and state several open problems.
Objavljeno v RUP: 03.01.2022; Ogledov: 662; Prenosov: 15
.pdf Celotno besedilo (261,26 KB)

6.
Mathematical aspects of fullerenes
Vesna Andova, František Kardoš, Riste Škrekovski, 2016, izvirni znanstveni članek

Opis: Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all other faces are hexagons. Fullerene graphs are mathematical models of fullerene molecules, i.e., molecules comprised only by carbon atoms different than graphites and diamonds. We give a survey on fullerene graphs from our perspective, which could be also considered as an introduction to this topic. Different types of fullerene graphs are considered, their symmetries, and construction methods. We give an overview of some graph invariants that can possibly correlate with the fullerene molecule stability, such as: the bipartite edge frustration, the independence number, the saturation number, the number of perfect matchings, etc.
Ključne besede: fullerene, cubic graph, planar graph, topological indices
Objavljeno v RUP: 03.01.2022; Ogledov: 721; Prenosov: 17
.pdf Celotno besedilo (626,25 KB)

7.
Mathematical aspects of Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh, 2016, izvirni znanstveni članek

Opis: The Wiener index (i.e., the total distance or the transmission number), defined as the sum of distances between all unordered pairs of vertices in a graph, is one of the most popular molecular descriptors. In this article we summarize some results, conjectures and problems on this molecular descriptor, with emphasis on works we were involved in.
Ključne besede: Wiener index, total distance, topological index, molecular descriptor, chemical graph theory
Objavljeno v RUP: 03.01.2022; Ogledov: 982; Prenosov: 27
.pdf Celotno besedilo (434,58 KB)

8.
On 12-regular nut graphs
Nino Bašić, Martin Knor, Riste Škrekovski, 2021, izvirni znanstveni članek

Ključne besede: nut graph, adjacency matrix, singular matrix, core graph, Fowler construction, regular graph
Objavljeno v RUP: 16.07.2021; Ogledov: 989; Prenosov: 24
URL Povezava na celotno besedilo

9.
Eccentricity of networks with structural constraints
Matjaž Krnc, Jean-Sébastien Sereni, Riste Škrekovski, Zelealem B. Yilma, 2018, izvirni znanstveni članek

Ključne besede: eccentricity, network, bipartite graph, complex network, maximum degree
Objavljeno v RUP: 22.08.2019; Ogledov: 1688; Prenosov: 144
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici