Št. zadetkov: 12
Izvirni znanstveni članek
Oznake:
graph;diameter;wiener index;transmission;eccentricity;
Let w$_G$(u) be the sum of distances from u to all the other vertices of G. The Wiener complexity, C$_W$(G), is the number of different values of w$_G$(u) in G, and the eccentric complexity, C$_{ec}$(G), is the number of different eccentricities in G. In this paper, we prove that for every integer c ...
Leto:
2021
Vir:
Fakulteta za matematiko in fiziko (UL FMF)
Izvirni znanstveni članek
Oznake:
ne zaključna dela;SMP polynomial;edge-SMP polynomial;Cartesian product;Szeged index;Mostar index;PI index;
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex-)PI index. For these indices, the corresponding polynomials were also defined, i.e., the (edge-)Szeged polynomial, the ...
Leto:
2023
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Izvirni znanstveni članek
Oznake:
orešni graf;matrika sosednosti;singularna matrika;sredični graf;Fowlerjeva konstrukcija;regularen graf;nut graph;adjacency matrix;singular matrix;core graph;Fowler construction;regular graph;
Leto:
2021
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
Wiener index;total distance;topological index;molecular descriptor;chemical graph theory;
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 descript ...
Leto:
2016
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
Wiener index;line graph;tree;iterated line graph;
Leto:
2018
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
ne zaključna dela;edge-Hosoya polynomial;graphs;phenylenes;
The edge-Hosoya polynomial of a graph is the edge version of the famous Hosoya polynomial. Therefore, the edge-Hosoya polynomial counts the number of (unordered) pairs of edges at distance $k \ge 0$ in a given graph. It is well known that this polynomial is closely related to the edge-Wiener index a ...
Leto:
2023
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Izvirni znanstveni članek
Oznake:
razdalja v grafu;Wienerjev indeks;topološki indeks;kemijska teorija grafov;graph distance;Wiener index;average distance;topological index;molecular descriptor;chemical graph theory;
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of research. This work presents a natural continuation of the paper Ma ...
Leto:
2024
Vir:
Repozitorij Univerze v Ljubljani (RUL)
Izvirni znanstveni članek
Oznake:
Cayleyev graf;razdalja;Cayley graph;distance;resolving set;
For ▫$n \ge 2t+1$▫ where ▫$t \ge 1$▫, the circulant graph ▫$C_n (1, 2, \dots , t)$▫ consists of the vertices ▫$v_0, v_1, v_2, \dots , v_{n-1}$▫ and the edges ▫$v_i v_{i+1}$▫, ▫$v_i v_{i+2}, \dots , v_i v_{i + t}$▫, where ▫$i = 0, 1, 2, \dots , n-1$▫, and the subscripts are taken modulo ▫$n$▫. We pro ...
Leto:
2025
Vir:
Fakulteta za matematiko in fiziko (UL FMF)
Izvirni znanstveni članek
Oznake:
Šoltés problem;Wiener index;regular graphs;cubic graphs;Cayley graph;Šoltés vertex;
Let ▫$W(G)$▫ be the Wiener index of a graph ▫$G$▫. We say that a vertex ▫$v \in V(G)$▫ is a Šoltés vertex in ▫$G$▫ if ▫$W(G - v) = W(G)$▫, i.e. the Wiener index does not change if the vertex ▫$v$▫ is removed. In 1991, Šoltés posed the problem of identifying all connected graphs ▫$G$▫ with the proper ...
Leto:
2025
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
graph distance;Wiener index;average distance;topological index;molecular descriptor;chemical graph theory;
Leto:
2024
Vir:
Repozitorij Univerze na Primorskem (RUP)