Results 1 to 10 of about 8,152,507 (265)
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source
Signless Laplacian spectrum of power graphs of finite cyclic groups
In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj +1 more source
The topological (graph) structure of complex networks often provides valuable information about the performance and vulnerability of the network. However, there are multiple ways to represent a given network as a graph.
Barrows, Clayton +3 more
core +1 more source
The power graph of a torsion-free group determines the directed power graph [PDF]
The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted with $\mathcal G(\mathbf G)$, is the underlying simple graph. In this paper, for groups $\mathbf G$ and $\mathbf H$, the following is proved.
openaire +3 more sources
On groups with specified quotient power graphs [PDF]
. In this paper we study some relations between the power andquotient power graph of a finite group. These interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a ...
Mostafa Shaker, Mohammadali Iranmanesh
doaj
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
Abbe, Emmanuel +3 more
openaire +2 more sources
Operation control of power systems has become challenging with an increase in the scale and complexity of power distribution systems and extensive access to renewable energy.
Kai Xiao +4 more
doaj +1 more source
Boxicity and Cubicity of Product Graphs
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$.
Chandran, L. Sunil +3 more
core +1 more source
Analysis of the Web Graph Aggregated by Host and Pay-Level Domain
In this paper the web is analyzed as a graph aggregated by host and pay-level domain (PLD). The web graph datasets, publicly available, have been released by the Common Crawl Foundation and are based on a web crawl performed during the period May-June ...
A Barabasi +4 more
core +2 more sources
As the widespread integration of new energy and interconnection of large power grids, the operation modes of power systems are undergoing transformations, which leads to a fast surge in data volumes and higher demands for real-time information processing,
Pei ZHANG +8 more
doaj +1 more source

