Results 21 to 30 of about 254,638 (264)
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 {\em power index} $Θ(Γ)$ of a graph $Γ$ is the least order of a group $G$ such that $Γ$ can embed into the power graph of $G$. Furthermore, this group $G$ is {\em $Γ$-optimal} if $G$ has order $Θ(Γ)$. We say that $Γ$ is {\em power-critical} if its order equals to $Θ(Γ)$. This paper focuses on the power indices of complete graphs, complete bipartite
Xuanlong Ma, Min Feng 0004, Kaishun Wang
openaire +3 more sources
For a graph $G$, its $r$th power is constructed by placing an edge between two vertices if they are within distance $r$ of each other. In this note we study the amount of edges added to a graph by taking its $r$th power. In particular we obtain that, for $r\geq 3$, either the $r$th power is complete or "many" new edges are added.
openaire +5 more sources
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
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
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
Graph Powering and Spectral Robustness
Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix $A$, one may look at the spectrum of $ψ(A)$ for a properly chosen $ψ$. The issue is that the spectrum of $A$ might be contaminated by non-informational top eigenvalues, e.g., due to ...
Emmanuel Abbe +3 more
openaire +2 more sources
Quotient graphs for power graphs [PDF]
In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G ...
BUBBOLONI, DANIELA +2 more
openaire +3 more sources
On the tree-number of the power graph associated with some finite groups [PDF]
Given a group G, we define the power graph P(G) as follows: the vertices are the elements of G and two vertices x and y are joined by an edge if ⟨x⟩ ⊆ ⟨y⟩ or ⟨y⟩ ⊆ ⟨x⟩.
Sakineh Rahbariyan
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

