Results 31 to 40 of about 256,711 (164)
Perfect codes in power graphs of finite groups
The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
Reliable and accurate ultra-short-term prediction of wind power is vital for the operation and optimization of power systems. However, the volatility and intermittence of wind power pose uncertainties to traditional point prediction, resulting in an ...
Wenlong Liao +5 more
doaj +1 more source
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
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
On the Powers of Signed Graphs
A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
T V, Shijin, K A, Germina, K, Shahul
openaire +2 more sources
This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Jemal Abawajy +2 more
openaire +4 more sources
Summary: We define a new graph operation called the \(k\)th inner power. The construction-which is somewhat analogous to the \(k\)th power with respect to the direct product-seems to lend itself nicely to certain questions concerning cancellation over the direct product.
Richard H. Hammack, Neal Livesay
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
Towards sparse matrix operations: graph database approach for power grid computation
The construction of new power systems presents higher requirements for the Power Internet of Things (PIoT) technology. The “source-grid-load-storage” architecture of a new power system requires PIoT to have a stronger multi- source heterogeneous data ...
Daoxing Li +4 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Zhao, Liying Kang, Gerard J. Chang
openaire +2 more sources

