40 citations · 43 across the 4 of their papers we have counts for
5 papers
Not all partial cubes are -graceful
Nathann Cohen, Matjaž Kovše
It is shown that the graph obtained by merging two vertices of two 4-cycles is not a -graceful partial cube, thus answering in the negative a question by Brešar and Klavžar from…
Steiner Wiener index of block graphs
Matjaž Kovše, Rasila V A, Ambat Vijayakumar
Let be a set of vertices of a connected graph . The Steiner distance of is the minimum size of a connected subgraph of containing all the vertices of . The Steine…
Topological Representation of the Transit Sets of k-Point Crossover Operators
Manoj Changat, Prasanth G. Narasimha-Shenoi, Ferdoos Hossein Nezhad +4
-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of -point crossover generate, for all , t…
New results on variants of covering codes in Sierpinski graphs
Sylvain Gravier, Matjaz Kovse, Michel Mollard +2
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…
Extremal graphs for the identifying code problem
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse +3
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 mo…