A locating-dominating set D of a graph G is dominating where each vertex not in has unique neighborhood D, and the Locating-Dominating Set problem asks if contains such bounded size. This known to be NP-hard even on restricted classes, as interval graphs, split planar bipartite subcubic graphs. On other hand, it solvable polynomial time for some trees and, more generally, graphs cliquewidth. Wh...

Abstract In this article, the aim is to enhance our understanding of who has power over leader selection in political parties. To end, we apply an analytical framework which process divided into three phases: gatekeeping, preparation and decision. The focus on determining extent each these phases influential for outcome thereby locating distribution intra‐party power. Underpinning analysis conv...

regarding the importance of competitive advantages among the transportation systems, improving the costumer’s satisfaction is an important factor in attracting them to these systems. in this research, we focus on the effects of constructing new stations on users and a new mathematical model is proposed for this problem. in the proposed model, two simultaneous effects on customers by constructin...

Let c be a vertex k -coloring on a connected graph G(V,E) . Let Π = {C1, C2, ..., Ck} be the partition of V (G) induced by the coloring c . The color code cΠ(v) of a vertex v in G is (d(v, C1), d(v, C2), ..., d(v, Ck)), where d(v, Ci) = min{d(v, x)|x ∈ Ci} for 1 ≤ i ≤ k. If any two distinct vertices u, v in G satisfy that cΠ(u) 6= cΠ(v), then c is called a locating k-coloring of G . The locatin...