Results 21 to 30 of about 1,358,458 (277)
Power Domination in Graphs [PDF]
In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process.
openaire +3 more sources
Mode Entanglement and Entangling power in Bosonic Graphs [PDF]
We analyze the quantum entanglement properties of bosonic particles hopping over graph structures.Mode-entanglement of a graph vertex with respect the rest of the graph is generated, starting from a product state, by turning on for a finite time a ...
Giorda, Paolo, Zanardi, Paolo
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brandstädt, Andreas, Le, Van Bang
openaire +2 more sources
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs [PDF]
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules.
Dwyer, Tim +5 more
core +1 more source
A Random Graph Model for Power Law Graphs [PDF]
We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. From these parameters, various properties of the
Aiello, William, Chung, Fan, Lu, Linyuan
openaire +2 more sources
Power graphs and exchange property for resolving sets
Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source
The cubic power graph of finite abelian groups
Let G be a finite abelian group with identity 0. For an integer the additive power graph of G is the simple undirected graph with vertex set G in which two distinct vertices x and y are adjacent if and only if x + y = nt for some with When the additive ...
R. Raveendra Prathap, T. Tamizh Chelvam
doaj +1 more source
Permutational Powers of a Graph [PDF]
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Cavaleri, Matteo +2 more
openaire +3 more sources
A Comprehensive Approach to Synthetic Distribution Grid Generation: Erdős–Rényi to Barabási-Albert [PDF]
In this extended study, the focus is on advancing the generation of synthetic distribution grids (SDGs) through the introduction of a new algorithm based on the Barabási-Albert random graph model.
Mohammad Shahraeini
doaj +1 more source
Research Review of the Knowledge Graph and its Application in Power System Dispatching and Operation
With the construction of a new power system and the proposal of a double carbon goal, power system operation data are growing explosively, and the optimization of power system dispatching operation is becoming more and more complex.
Junbin Chen +5 more
doaj +1 more source

