20 citations · 25 across the 6 of their papers we have counts for
10 papers · 1 filter
Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
Bostjan Bresar, Tanja Dravec, Daniel P. Johnston +3
The isolation number of a graph is the minimum cardinality of a set such that the subgraph induced by the vertices that are not in the union of the close…
Selected topics on Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, wh…
Domination versus independent domination in regular graphs
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
A set of vertices in a graph is a dominating set if every vertex of is in or is adjacent to a vertex in . If, in addition, is an independent set, then is…
Bounding the k-rainbow total domination number
Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh
Recently the notion of -rainbow total domination was introduced for a graph , motivated by a desire to reduce the problem of computing the total domination number of the gene…
On -rainbow independent domination in graphs
Tadeja Kraner Šumenjak, Douglas F. Rall, Aleksandra Tepeh
In this paper, we define a new domination invariant on a graph , which coincides with the ordinary independent domination number of the generalized prism , called th…
On the minimum value of sum-Balaban index
Martin Knor, Jaka Kranjc, Riste Škrekovski +1
We consider extremal values of sum-Balaban index among graphs on vertices. We determine that the upper bound for the minimum value of the sum-Balaban index is at most …
Mathematical aspects of Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
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 popul…
Partitioning the vertex set of to make an efficient open domination graph
Tadeja Kraner Šumenjak, Iztok Peterin, Douglas F. Rall +1
A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs for which the…
Distance magic labeling and two products of graphs
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin +1
Let be a graph of order . A distance magic labeling of is a bijection for which there exists a positive integer such that…
Rainbow domination in the lexicographic product of graphs
Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh
Let k be a positive integer and let f be a map from V(G) to the set of all subsets of {1,2,3,...,k}. The function f is called a k-rainbow dominating function of G provided that whe…