Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Kovse, Matjaz"'
Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-W
Externí odkaz:
http://arxiv.org/abs/1809.10767
Autor:
Cohen, Nathann, Kovše, Matjaž
It is shown that the graph obtained by merging two vertices of two 4-cycles is not a $\Theta$-graceful partial cube, thus answering in the negative a question by Bre\v{s}ar and Klav\v{z}ar from [1], who asked whether every partial cube is $\Theta$-gr
Externí odkaz:
http://arxiv.org/abs/1809.05320
Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The Steiner $k$-Wiener index is the sum of all Steiner distances on sets of $k$
Externí odkaz:
http://arxiv.org/abs/1805.08143
Autor:
Changat, Manoj, Narasimha-Shenoi, Prasanth G., Nezhad, Ferdoos Hossein, Kovše, Matjaž, Mohandas, Shilpa, Ramachandran, Abisha, Stadler, Peter F.
$k$-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of $k$-point crossover generate, for all $k>1$, the same convexity as the interval function of the underlying graph. Th
Externí odkaz:
http://arxiv.org/abs/1712.09022
Autor:
Kovše, Matjaž
A formula based on a vertex contributions of the Steiner $k$-Wiener index is induced by a newly introduced $k$-Steiner betweenness centrality, which measures the number of $k$-Steiner trees that include a particular vertex as a non-terminal vertex. T
Externí odkaz:
http://arxiv.org/abs/1605.00260
Autor:
Changat, Manoj, Narasimha-Shenoi, Prasanth G., Nezhad, Ferdoos Hossein, Kovše, Matjaž, Mohandas, Shilpa, Ramachandran, Abisha, Stadler, Peter F.
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics March 2019
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs.
Externí odkaz:
http://arxiv.org/abs/1201.1202
Autor:
Foucaud, Florent, Guerrini, Eleonora, Kovse, Matjaz, Naserasr, Reza, Parreau, Aline, Valicov, Petru
Publikováno v:
European Journal of Combinatorics 32, 4 (2011) 628-638
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum pos
Externí odkaz:
http://arxiv.org/abs/1004.5230
Publikováno v:
Taiwanese Journal of Mathematics, 2014 Aug 01. 18(4), 1243-1255.
Externí odkaz:
https://www.jstor.org/stable/taiwjmath.18.4.1243
Autor:
Foucaud, Florent, Kovše, Matjaž
Publikováno v:
In Journal of Discrete Algorithms November 2013 23:21-34