The power domination problem is a variant of the classical domination problem in graphs and is defined as follows. Given an undirected graph G = (V,E), the problem is to find a minimum vertex set P ⊆ V , called the power dominating set of G, such that all vertices in G are observed by the vertices of P . Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all b...

In smart power grids, keeping the synchronicity of generators and the corresponding controls is of great importance. To do so, a simple model is employed in terms of swing equation to represent the interactions among dynamics of generators and feedback control. In case of having a communication network available, the control can be done based on the transmitted measurements by the communication...

A judicious use of labelled terms makes it possible to bring together the simplicity of term rewriting and the sharing power of graph rewriting: this has been known for twenty years in the particular case of orthogonal first-order systems. The present paper introduces a concise and easily usable axiomatic presentation of sharing-via-labelling techniques that applies to higher-order term rewriti...

It was conjectured by Tutte that every 4-edge-connected graph admits a nowherezero 3-flow. In this paper, we give a complete characterization of graphs whose squares admit nowhere-zero 3-flows and thus confirm Tutte’s 3-flow conjecture for the family of squares of graphs.

Propose a fault diagnosis method which combines analytical redundancy with bond graph model for electrolytic high power rectifier system. Firstly, using the software 20-sim, the author builds a bond graph model of the system and established a diagnostic bond graph model through adding virtual sensor in bond graph model; then, according to the causal relationship in the components, analytical re...

Randomly generated graphs with power law degree distribution are typically used to model large real-world networks. These graphs have small average distance. However, the small world phenomenon includes both small average distance and the clustering effect, which is not possessed by random graphs. Here we use a hybrid model which combines a global graph (a random power law graph) with a local g...

Embedded systems have pervaded all walks of our life. With the increasing importance of mobile embedded systems and flexible applications, considerable progress in research has been made for power management. Power constraints are increasingly becoming the critical component of the design specifications of these systems. It helps in pre-determining the suitable hardware architecture for the tar...

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential attachment and copying mechanisms that existing evolving graph processes fail to model due to technical obstacles. The result also serves as a further cautionary ...

We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several well-studied notions of computation, including ordinary Turing machines, cellular automata, and parallel graph dynamical systems. We analyze the power of computatio...