Results 61 to 70 of about 1,356,811 (224)

Distinguishing Cartesian Powers of Graphs [PDF]

The Electronic Journal of Combinatorics, 2005
Given a graph $G$, a labeling $c:V(G) \rightarrow \{1, 2, \ldots, d\}$ is said to be $d$-distinguishing if the only element in ${\rm Aut}(G)$ that preserves the labels is the identity. The distinguishing number of $G$, denoted by $D(G)$, is the minimum $d$ such that $G$ has a $d$-distinguishing labeling.
openaire   +2 more sources

Power Prediction of Regional Photovoltaic Power Stations Based on Meteorological Encryption and Spatio-Temporal Graph Networks

Energies
Distributed photovoltaic (PV) power stations generally lack historical meteorological data, which is one of the main reasons for their insufficient power prediction accuracy.
Shunli Deng, Shuangxi Cui, Anchen Xu
doaj   +1 more source

Perfect codes in power graphs of finite groups

Open Mathematics, 2017
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, Fu Ruiqin, Lu Xuefei, Guo Mengxia, Zhao Zhiqin   +4 more
doaj   +1 more source

On the tree-number of the power graph associated with some finite groups [PDF]

AUT Journal of Mathematics and Computing
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

Magic powers of graphs [PDF]

Mathematica Bohemica, 1997
The concept of magic graph was introduced by J. Sedláček. A valuation of the edges of a graph by pairwise different positive numbers is called magic, if the sum of values of edges incident with a given vertex is the same for all vertices. If there exists a magic valuation of a graph \(G\), then \(G\) is called a magic graph.
Trenkler, M., Vetchý, V.
openaire   +1 more source

Power optimization in MANET using topology management

Engineering Science and Technology, an International Journal, 2020
Mobile ad-hoc network (MANET) is a wireless ad hoc network, which is quickly deployable and functions without any infrastructure. This work proposes a hybrid optimization algorithm, named Chronological-Earth Worm optimization Algorithm (C-EWA), for ...
B. Devika, P.N. Sudha
doaj   +1 more source

On some characterizations of strong power graphs of finite groups

Special Matrices, 2016
Let G be a finite group of order n. The strong power graph Ps(G) of G is the undirected graph whose vertices are the elements of G such that two distinct vertices a and b are adjacent if am1=bm2 for some positive integers m1, m2 < n.
Bhuniya A. K., Bera Sudip
doaj   +1 more source

Mitigation of Cascading Outages Using a Dynamic Interaction Graph-Based Optimal Power Flow Model

IEEE Access, 2019
Online decision support for effective mitigation actions against propagating cascading outages in a power grid still poses a big challenge to grid operators.
Changsheng Chen, Wenyun Ju, Kai Sun, Shiying Ma   +3 more
doaj   +1 more source

Hierarchical dynamic aggregation graph modeling of vibration for semi-supervised fault diagnosis of power transformer

, 2023
Xiaoyan Liu, Yigang He
openalex   +1 more source

Power graphs: A survey

Electronic Journal of Graph Theory and Applications, 2013
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, Andrei Kelarev, Morshed Chowdhury   +2 more
openaire   +3 more sources