1. |
2. |
3. Mathematical aspects of Wiener indexMartin 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: 1213; Downloads: 37 Full text (434,58 KB) |
4. On minimal forbidden subgraphs for the class of EDM-graphsGaš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: 996; Downloads: 20 Full text (711,65 KB) |
5. Edge-contributions of some topological indices and arboreality of molecular graphsTomaž Pisanski, Janez Žerovnik, 2009, original scientific article Abstract: Some graph invariants can be computed by summing certain values, called edge-contributions over all edges of graphs. In this note we use edge-contributions to study relationships among three graph invariants, also known as topological indices in mathematical chemistry: Wiener index, Szeged index and recently introduced revised Szeged index. We also use the quotient between the Wiener index and the revised Szeged index to study tree-likeness of graphs. Keywords: mathematical chemistry, chemical graph theory, topological index, revised Szeged index Published in RUP: 30.12.2021; Views: 975; Downloads: 19 Full text (158,93 KB) |
6. |
7. |
8. |
9. Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing unitsChristian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes, 2014, published scientific conference contribution Keywords: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique Published in RUP: 18.10.2021; Views: 1120; Downloads: 23 Link to full text |
10. |