Abstract Located in the eastern section of ancient Silk Road, Hexi Corridor is a crucial area where and western civilizations met. Previous studies mainly explore human-nature interactions at particular period, there lack phased interaction long time scales. Here we present relationships patterns between humans nature region over past 10 000 years distinguish stages mechanisms interaction, whic...

Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination k -number γk(G) of G is the minimum cardinality of a Smarandachely dominating k -set of G. S is called weak domination set if ...

Let G be an IFG. Then V D  is said to bae a strong (weak) dominating set if every D V v   is strongly (weakly) dominated by some vertex in D. We denote the strong (weak) intuitionistic fuzzy dominating set by sid-set (wid-set). The minimum vertex cardinality over all the sid-set (wid-set) is called the strong (weak) dominating number of an IFG and is denoted by )] ( [ ) ( G G wid sid   In ...

Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces un...

Different topological indices will always be valuable in a variety of disciplines, including chemistry, economics, electronics, business studies, social sciences and medicine. According to the dominating set number, Wiener index for neutrosophic graphs (NG) studied considerable detail this research.
 Additionally, Average an NG has been defined, several associated theorems have introduced.

In this paper, we continue the study of the domination game in graphs introduced by Brešar, Klavžar, and Rall [SIAM J. Discrete Math. 24 (2010) 979–991]. We study the total version of the domination game and show that these two versions differ significantly. We present a key lemma, known as the Total Continuation Principle, to compare the Dominator-start total domination game and the Staller-st...

In this article we give a new definition of direct product of two arbitrary fuzzy graphs. We define the concepts of domination and total domination in this new product graph. We obtain an upper bound for the total domination number of the product fuzzy graph. Further we define the concept of total α-domination number and derive a lower bound for the total domination number of the product fuzzy ...

Let γb(G) denote the broadcast domination number for a graph G. In [Discrete Applied Math. 154 (2006), 59–75], Dunbar et al. determined the value of γb(G), where G is the Cartesian product of two paths. In this paper, we evaluate the value of γb(G), whenever G is the strong product, the direct product and the lexicographic product of two paths.