Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 7
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: topological index;Balaban index;sum-Balaban index;Randić index;
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ć inde ...
Leto: 2020 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 7
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: