A. Taranenko

activity

20142021

most citedSpan of a Graph: Keeping the Safety Distance

3 citations · 5 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2021★ 3 cited

Span of a Graph: Keeping the Safety Distance

Iztok Banič, Andrej Taranenko

Inspired by Lelek's idea from [Disjoint mappings and the span of spaces, Fund. Math. 55 (1964), 199 -- 214], we introduce the novel notion of the span of graphs. Using this, we sol…

math.CO2021

Irregularity of expansions and Pell graphs

Andrej Taranenko

For a graph $G$ the imbalance of an edge $uv$ of $G$ is $∣ d e g_{G} (u) - d e g_{G} (v) ∣$ . Irregularity of a graph $G$ is defined as the sum of imbalances over all edges of $G$ . In this paper…

math.CO2020

Daisy Hamming graphs

Tanja Gologranc, Andrej Taranenko

Daisy graphs of a rooted graph $G$ with the root $r$ were recently introduced as a generalization of daisy cubes, a class of isometric subgraphs of hypercubes. In this paper we fir…

math.CO2019

Daisy cubes: a characterization and a generalization

Andrej Taranenko

Daisy cubes are a recently introduced class of isometric subgraphs of hypercubes $Q_{n}$ . They are induced with intervals between chosen vertices of $Q_{n}$ and the vertex $0^n\in V(Q_…

math.CO2016

Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko +1

Let $G = (V, E)$ be a connected graph. A vertex $w \in V$ distinguishes two elements (vertices or edges) $x, y \in E \cup V$ if $d_{G} (w, x) \neq = d_{G} (w, y)$ . A set $S$ of vertices in a connecte…

math.CO2014★ 2 cited

A note on the Thue chromatic number of lexicographic products of graphs

Iztok Peterin, Jens Schreyer, Erika Škrabuľáková +1

A sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_{1}, r_{2}, \dots, r_{2 n}$ such that $r_{i} = r_{n + i}$ for all $1 \leq i \leq n$ ). Let $G$ be a…