12 citations · 12 across the 6 of their papers we have counts for
6 papers
Locating-dominating coalitions in graphs
M. Chellali, A. A. Dobrynin, F. Foucaud +2
A set of vertices in a graph is a locating-dominating set (LD-set) if it is dominating and every two vertices , of satisfy $N(u) \cap D \neq…
Coalition graphs of connected domination partitions in subcubic graphs
Andrey A. Dobrynin, Aleksey N. Glebov
A graph is subcubic if it is connected and its maximum vertex degree does not exceed 3. Two disjoint vertex subsets of a graph form a connected coalition in if neither of t…
On cubic graphs having the maximal coalition number
Andrey A. Dobrynin, Hamidreza Golmohammadi
A coalition in a graph with vertex set consists of two disjoint sets such that neither nor is a dominating set, but the union …
Some results on the Wiener index related to the Šoltés problem of graphs
Andrey A. Dobrynin, Konstantin V. Vorob'ev
The Wiener index, , of a connected graph is the sum of distances between its vertices. In 2021, Akhmejanova et al. posed the problem of finding graphs with large $R_m…
On the Wiener (r,s)-complexity of fullerene graphs
Andrey A. Dobrynin, Andrei Yu. Vesnin
Fullerene graphs are mathematical models of fullerene molecules. The Wiener -complexity of a fullerene graph with vertex set is the number of pairwise distinct va…
On the Wiener complexity and the Wiener index of fullerene graphs
Andrey A. Dobrynin, Andrei Yu. Vesnin
Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of…