Zobrazeno 1 - 10
of 560
pro vyhledávání: '"Škrekovski, Riste"'
The $\sigma_{t}$-irregularity (or sigma total index) is a graph invariant which is defined as $\sigma_{t}(G)=\sum_{\{u,v\}\subseteq V(G)}(d(u)-d(v))^{2},$ where $d(z)$ denotes the degree of $z$. This irregularity measure was proposed by R\' {e}ti [Ap
Externí odkaz:
http://arxiv.org/abs/2411.04881
The total $\sigma$-irregularity is given by $ \sigma_t(G) = \sum_{\{u,v\} \subseteq V(G)} \left(d_G(u) - d_G(v)\right)^2, $ where $d_G(z)$ indicates the degree of a vertex $z$ within the graph $G$. It is known that the graphs maximizing $\sigma_{t}$-
Externí odkaz:
http://arxiv.org/abs/2411.01530
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(
Externí odkaz:
http://arxiv.org/abs/2410.03656
A strong odd coloring of a simple graph $G$ is a proper coloring of the vertices of $G$ such that for every vertex $v$ and every color $c$, either $c$ is used an odd number of times in the open neighborhood $N_G(v)$ or no neighbor of $v$ is colored b
Externí odkaz:
http://arxiv.org/abs/2410.02336
The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g^{\prime},h^{\prime})$ of $G\diamond H$ are adjacent if $g=g^{\prime}$ and $hh^{\prime}\in E(H)$, or $gg^{\prime}\in E(G)$
Externí odkaz:
http://arxiv.org/abs/2404.02853
Autor:
Sedlar, Jelena, Škrekovski, Riste
A proper abelian coloring of a cubic graph G by a finite abelian group A is any proper edge-coloring of G by the non-zero elements of A such that the sum of the colors of the three edges incident to any vertex v of G equals zero. It is known that cyc
Externí odkaz:
http://arxiv.org/abs/2402.06008
Autor:
Sedlar, Jelena, Škrekovski, Riste
A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement that every b
Externí odkaz:
http://arxiv.org/abs/2312.08739
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a generalization
Externí odkaz:
http://arxiv.org/abs/2309.00922
Autor:
Sedlar, Jelena, Škrekovski, Riste
Publikováno v:
European Journal of Combinatorics 122 (2024) 104038
An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edge-coloring in which every edge of G is normal. The Petersen Coloring C
Externí odkaz:
http://arxiv.org/abs/2306.13340
Autor:
Sedlar, Jelena, Škrekovski, Riste
In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich (resp. poor) if the number of colors of all edges incident to end-vertices of e is 5 (resp. 3). An edge-coloring of G is is normal if every edge of G is either rich or poor.
Externí odkaz:
http://arxiv.org/abs/2305.05981