149 citations · 707 across the 83 of their papers we have counts for
6 papers · 1 filter
On three outer-independent domination related parameters in graphs
Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1
Let be a graph and let . The set is a double outer-independent dominating set of if , for all , and is…
Incidence dimension and 2-packing number in graphs
Dragana Bozovic, Aleksander Kelenc, Iztok Peterin +1
Let be a graph. A set of vertices is an incidence generator for if for any two distinct edges there exists a vertex from which is an endpoint of…
Edge metric dimension of some graph operations
Iztok Peterin, Ismael G. Yero
Let be a connected graph. Given a vertex and an edge , the distance between and is defined as . A nonempt…
On analyzing and evaluating privacy measures for social networks under active attack
Bhaskar DasGupta, Nasim Mobasheri, Ismael G. Yero
Widespread usage of complex interconnected social networks such as Facebook, Twitter and LinkedIn in modern internet era has also unfortunately opened the door for privacy violatio…
Efficient closed domination in digraph products
Iztok Peterin, Ismael G. Yero
A digraph is an efficient closed domination digraph if there exists a subset of for which the closed out-neighborhoods centered in vertices of form a partition o…
Packing and domination parameters in digraphs
Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero
Given a digraph , a set is a packing set in if there are no arcs joining vertices of and for any two vertices the sets of in-neighbors of $…