Results 31 to 40 of about 272,972 (308)
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
The Electronic Journal of Combinatorics, 2011 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]
Experimental Mathematics, 2001 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]
AUT Journal of Electrical EngineeringIn 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
AKCE International Journal of Graphs and Combinatorics, 2021 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
SIAM Journal on Mathematics of Data Science, 2020 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]
Rendiconti del Seminario Matematico della Università di Padova, 2017 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]
AUT Journal of Mathematics and ComputingGiven 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
Journal of Modern Power Systems and Clean Energy, 2023 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
Clawfreeness of the powers of a graph
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Bahls, Nicole A. Gin
openaire +2 more sources