The Wiener index W is the sum of distances between all pairs of vertices of a (connected)
graph. The paper outlines the results known for W of trees: methods for computation of W …

The Wiener index W is the sum of distances between all pairs of vertices of a (connected)
graph. Hexagonal systems (HS's) are a special type of plane graphs in which all faces are …

We use the link between the existence of tilings in Manhattan metric with {1}-bowls and
minimum total dominating sets of Cartesian products of paths and cycles. From the existence …

By suitably adjusting the tropical algebra technique we compute the rainbow independent
domination numbers of several infinite families of graphs including Cartesian products C n …

Roman domination is an historically inspired variety of domination in graphs, in which
vertices are assigned a value from the set $\{0, 1, 2\} $ in such a way that every vertex …

Using algebraic approach we implement a constant time algorithm for computing the
domination numbers of the Cartesian products of paths and cycles. Closed formulas are …

We obtain new results on independent 2-and 3-rainbow domination numbers of generalized
Petersen graphs P (n, k) for certain values of n, k∈ N. By suitably adjusting and applying a …

Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A
computer-based approach for searching graph invariants on rotagraphs is proposed and …

Given a positive integer t and a graph F, the goal is to assign a subset of the color set {1, 2,
..., t\} 1, 2,…, t to every vertex of F such that every vertex with the empty set assigned has all t …

Symmetry | Free Full-Text | On Three-Rainbow Dominationof Generalized Petersen Graphs
P(ck,k) Next Article in Journal Symmetry Analysis of the Complex Polytypism of Layered …