Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme


1 - 10 / 33
First pagePrevious page1234Next pageLast page
Analiza blagovnih trgov : pristop teorije grafov
Luka Pavlović, 2023, master's thesis

Keywords: graph, minimum spanning tree, strenght, betwenness, distance, commodites
Published in RUP: 25.08.2023; Views: 244; Downloads: 4
.pdf Full text (1,20 MB)

Mathematical aspects of Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh, 2016, original scientific article

Abstract: 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.
Keywords: Wiener index, total distance, topological index, molecular descriptor, chemical graph theory
Published in RUP: 03.01.2022; Views: 643; Downloads: 25
.pdf Full text (434,58 KB)

On minimal forbidden subgraphs for the class of EDM-graphs
Gašper Jaklič, Jolanda Modic, 2015, original scientific article

Abstract: In this paper, a relation between graph distance matrices and Euclidean distance matrices (EDM) is considered. Graphs, for which the distance matrix is not an EDM (NEDM-graphs), are studied. All simple connected non-isomorphic graphs on ▫$n \le 8$▫ nodes are analysed and a characterization of the smallest NEDM-graphs, i.e., the minimal forbidden subgraphs, is given. It is proven that bipartite graphs and some subdivisions of the smallest NEDM-graphs are NEDM-graphs, too.
Keywords: graph theory, graph, Euclidean distance matrix, distance, eigenvalue
Published in RUP: 31.12.2021; Views: 667; Downloads: 15
.pdf Full text (711,65 KB)

Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, published scientific conference contribution

Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Published in RUP: 16.07.2021; Views: 1018; Downloads: 29
URL Link to full text

On a version of the spectral excess theorem
Miquel Àngel Fiol, Safet Penjić, 2020, original scientific article

Keywords: adjacency algebra, spectrum, distance-regular graph, Laplacian
Published in RUP: 02.12.2020; Views: 1148; Downloads: 34
URL Link to full text

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