Vladimir Samodivkin

activity

20122020

most citedNote on the bondage number of graphs on topological surfaces

4 citations · 4 across the 4 of their papers we have counts for

collaborators

7 papers

math.CO2020

Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

Vladimir Samodivkin

A graph $G = (V, E)$ is $γ$ -excellent if $V$ is a union of all $γ$ -sets of $G$ , where $γ$ stands for the domination number. Let $I$ be a set of all mutually nonisomorphic gr…

math.CO2020

Domination related parameters in the generalized lexicographic product of graphs

Vladimir Samodivkin

In this paper we begin an exploration of several domination-related parameters (among which are the total, restrained, total restrained, paired, outer connected and total outer con…

math.CO2018

Changing and unchanging 2-rainbow independent domination

Pu Wu, Zehui Shao, Vladimir Samodivkin +3

For a function $f : V (G) \to {0, 1, 2}$ we denote by $V_{i}$ the set of vertices to which the value $i$ is assigned by $f$ , i.e. $V_{i} = {x \in V (G) : f (x) = i}$ . If…

math.CO2018

Changing and unchanging of the domination number of a graph: Path addition numbers

Vladimir Samodivkin

Given a graph $G = (V, E)$ and two its distinct vertices $u$ and $v$ . The $(u, v)$ - $P_{k}$ -{\em addition graph} of $G$ is the graph $G_{u, v, k - 2}$ obtained from disjoint union of $G$ an…

math.CO2017

Roman domination: changing, unchanging, $γ_{R}$ -graphs

Vladimir Samodivkin

A Roman dominating function (RD-function) on a graph $G = (V (G), E (G))$ is a labeling $f : V (G) \to {0, 1, 2}$ such that every vertex with label $0$ has a neighbor with l…

math.CO2015

Changing of the domination number of a graph: edge multisubdivision and edge removal

Vladimir Samodivkin

For a graphical property $P$ and a graph $G$ , a subset $S$ of vertices of $G$ is a $P$ -set if the subgraph induced by $S$ has the property $P$ . The do…

Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

Domination related parameters in the generalized lexicographic product of graphs

Changing and unchanging 2-rainbow independent domination

Changing and unchanging of the domination number of a graph: Path addition numbers

Roman domination: changing, unchanging, γR​-graphs

Changing of the domination number of a graph: edge multisubdivision and edge removal

Roman domination: changing, unchanging, $γ_{R}$ -graphs