output
20032026
most citedLatency-Bounded Target Set Selection in Social Networks

66 citations

Showing 2015Show all

14 papers · 1 filter

math.CO2015

On Color Preserving Automorphisms of Cayley Graphs of Odd Square-free Order

Edward Dobson, Ademir Hujdurović, Klavdija Kutnar +1

An automorphism of a Cayley graph of a group with connection set is color-preserving if or for every edge $(g,gs)\in E(Cay(G…

math.CO2015★ 2 cited

Cyclic groups are CI-groups for balanced configurations

Hiroki Koike, István Kovács, Dragan Marušič +1

In this paper it is shown that every finite cyclic group satisfies the CI-property for the class of balanced configurations.

math.CO2015

1-perfectly orientable graphs and graph products

Tatiana Romina Hartinger, Martin Milanič

A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. g…

math.CO2015★ 28 cited

Domination parameters with number 2: interrelations and algorithmic consequences

Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo +2

In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which…

math.CO2015★ 9 cited

Coronoids, Patches and Generalised Altans

Nino Bašić, Patrick W. Fowler, Tomaž Pisanski

In this paper we revisit coronoids, in particular multiple coronoids. We consider a mathematical formalisation of the theory of coronoid hydrocarbons that is solely based on incide…

cs.DS2015★ 2 cited

Parallel Query in the Suffix Tree

Matevž Jekovec, Andrej Brodnik

Given the query string of length , we explore a parallel query in a static suffix tree based data structure for , where is the number of processors and is the l…