Vladimir Samodivkin

activity

20122020

most citedNote on the bondage number of graphs on topological surfaces

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

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Roman domination excellent graphs: trees

Vladimir Samodivkin

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

math.CO2016

Hypo-efficient domination and hypo-unique domination

Vladimir Samodivkin

For a graph $G$ let $γ (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo- $E D$ graph) if $G$ has no efficient domina…