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

66 citations

Showing 2017Show all

15 papers · 1 filter

math.CO2017★ 1 cited

On chromatic indices of finite affine spaces

Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel +1

The pseudoachromatic index of the finite affine space denoted by is the the maximum number of colors in any complete line-coloring of $\…

math.CO2017★ 5 cited

A counterexample to a conjecture on facial unique-maximal colorings

Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski

A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers where on each face the maximal color appears exactly once on the vertices of $α…

math.CO2017★ 13 cited

Predicting Melting Points by the Graovac-Pisanski Index

Matevž Črepnjak, Niko Tratnik, Petra Žigert Pleteršek

Theoretical molecular descriptors alias topological indices are a convenient means for expressing in a numerical form the chemical structure encoded in a molecular graph. The struc…

cs.DM2017★ 4 cited

On Almost Well-Covered Graphs of Girth at Least 6

Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1

We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-co…

math.CO2017★ 5 cited

On facial unique-maximum (edge-)coloring

Vesna Andova, Bernard Lidický, Borut Lužar +1

A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face the maximal color appears exactly once on the vertices of . If the coloring is requ…

math.NA2017

Dimension and basis construction for -smooth isogeometric spline spaces over bilinear-like two-patch parameterizations

Mario Kapl, Vito Vitrih

A particular class of planar two-patch geometries, called bilinear-like two-patch geometries, is introduced. This class includes the subclass of all bilinear two-patch para…