Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 5
Remarks on the Local Irregularity Conjecture
Jelena Sedlar, Riste Škrekovski
Izvirni znanstveni članek
Oznake: locally irregular edge coloring;local irregularity conjecture;unicyclic graph;cactus graph;
A locally irregular graph is a graph in which the end vertices of every edge have distinct degrees. A locally irregular edge coloring of a graph G is any edge coloring of G such that each of the colors induces a locally irregular subgraph of G. A graph G is colorable if it allows a locally irregular ...
Leto: 2021 Vir: Fakulteta za matematiko in fiziko (UL FMF)
On the inverse sum indeg index
Jelena Sedlar, Dragan Stevanović, Alexander Vasilyev
Izvirni znanstveni članek
Oznake: molecular descriptor;bond-additive descriptor;discrete Adriatic index;
On the inverse sum indeg index
Leto: 2015 Vir: Univerza na Primorskem (UP)
Fault tolerance of metric basis can be expensive
Martin Knor, Jelena Sedlar, Riste Škrekovski
Izvirni znanstveni članek
Oznake: metric dimension;fault-tolerant metric dimension;k-metric dimension;
A set of vertices ▫$S$▫ is a resolving set of a graph ▫$G$▫, if for every pair of vertices ▫$x$▫ and ▫$y$▫ in ▫$G$▫, there exists a vertex ▫$s$▫ in ▫$S$▫ such that x and y differ in distance to ▫$s$▫. A smallest resolving set of ▫$G$▫ is called a metric basis. The metric dimension ▫$\dim(G)$▫ is the ...
Leto: 2025 Vir: Fakulteta za matematiko in fiziko (UL FMF)
ǂThe ǂsubpath number of cactus graphs
Martin Knor, Jelena Sedlar, Riste Škrekovski, Yu Yang
Izvirni znanstveni članek
Oznake: subpath number;cactus graphs;extremal graphs;cycle chains;Wiener index;subtree number;
The subpath number of a graph ▫$G$▫ is defined as the total number of subpaths in ▫$G$▫, and it is closely related to the number of subtrees, a well-studied topic in graph theory. This paper is a continuation of our previous paper Knor et al. (Knor M, Sedlar J, Škrekovski R, et al (2026) Invitation ...
Leto: 2026 Vir: Repozitorij Univerze v Ljubljani (RUL)
ǂThe ǂ[sigma]-irregularity of trees with maximum degree 5
Darko Dimitrov, Žana Kovijanić-Vukićević, Goran Popivoda, Jelena Sedlar, Riste Škrekovski, Saša Vujošević
Izvirni znanstveni članek
Oznake: regular graph;trees;maximum degree;[sigma]-irregularity;maximal graphs;graph measure;topological index;
The ▫$\sigma$▫-irregularity, a variant of the well-established Albertson irregularity, is a topological invariant defined for a graph ▫$G=(V,E)$▫ as ▫$\sigma (G) = \sum_{u,v \in E}(d(u) - d(v))^2$▫, where ▫$d(u)$▫ and ▫$d(v)$▫ denote the degrees of vertices ▫$u$▫ and ▫$v$▫, respectively. Recent rese ...
Leto: 2026 Vir: Digitalni repozitorij raziskovalnih organizacij Slovenije
Št. zadetkov: 5
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: