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 - 10 / 33
Na začetekNa prejšnjo stran1234Na naslednjo stranNa konec
1.
Analiza blagovnih trgov : pristop teorije grafov
Luka Pavlović, 2023, magistrsko delo

Ključne besede: graph, minimum spanning tree, strenght, betwenness, distance, commodites
Objavljeno v RUP: 25.08.2023; Ogledov: 451; Prenosov: 4
.pdf Celotno besedilo (1,20 MB)

2.
3.
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: 954; Prenosov: 27
.pdf Celotno besedilo (434,58 KB)

4.
On minimal forbidden subgraphs for the class of EDM-graphs
Gašper Jaklič, Jolanda Modic, 2015, izvirni znanstveni članek

Opis: 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.
Ključne besede: graph theory, graph, Euclidean distance matrix, distance, eigenvalue
Objavljeno v RUP: 31.12.2021; Ogledov: 850; Prenosov: 17
.pdf Celotno besedilo (711,65 KB)

5.
6.
7.
8.
Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, objavljeni znanstveni prispevek na konferenci

Ključne besede: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Objavljeno v RUP: 16.07.2021; Ogledov: 1246; Prenosov: 30
URL Povezava na celotno besedilo

9.
10.
On a version of the spectral excess theorem
Miquel Àngel Fiol, Safet Penjić, 2020, izvirni znanstveni članek

Ključne besede: adjacency algebra, spectrum, distance-regular graph, Laplacian
Objavljeno v RUP: 02.12.2020; Ogledov: 1575; Prenosov: 35
URL Povezava na celotno besedilo

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