Results 81 to 90 of about 8,152,507 (265)

Metric and strong metric dimension in TI-power graphs of finite groups

AIMS Mathematics
Given a finite group $ G $ with the identity $ e $, the TI-power graph (trivial intersection power graph) of $ G $ is an undirected graph with vertex set $ G $, in which two distinct vertices $ x $ and $ y $ are adjacent if $ \langle x\rangle\cap \langle
Chunqiang Cui, Jin Chen, Shixun Lin
doaj   +1 more source

Efficient State Estimation Through Rapid Topological Analysis Based on Spatiotemporal Graph Methodology

IEEE Open Access Journal of Power and Energy
The seamless integration of swift and precise topological analysis with state estimation is crucial for ensuring the dependability, stability, and efficiency of the power system.
Zhen Dai, Shouyu Liang, Yachen Tang, Jun Tan, Guangyi Liu, Qinyu Feng, Xuanang Li   +6 more
doaj   +1 more source

Spatiotemporal Data Graph Modeling and Exploration of Application Scenarios in “Power Grid One Graph”

CSEE Journal of Power and Energy Systems
By modeling the spatiotemporal data of the power grid, it is possible to better understand its operational status, identify potential issues and risks, and take timely measures to adjust and optimize the system. Compared to the bus-branch model, the node-
Peng Li, Zhen Dai, Yachen Tang, Guangyi Liu, Jiaxuan Hou, Qinyu Feng, Quanchen Lin   +6 more
doaj   +1 more source

Graph Kernels via Functional Embedding [PDF]

, 2014
We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any reordering of ...
Li, Ping, Shrivastava, Anshumali
core  

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

A comprehensive large scale biomedical knowledge graph for AI powered data driven biomedical research [PDF]

, 2023
Yuan Zhang, Xin Sui, Feng Pan, Kaixian Yu, Keqiao Li, Shubo Tian, Arslan Erdengasileng, Qing Han, Wanjing Wang, Jianan Wang, Jian Wang, Donghu Sun, Henry Shu-Hung Chung, Jun Zhou, Eric S. Zhou, Benjamin Lee, Peili Zhang, Xing Qiu, Tingting Zhao, Jinfeng Zhang   +19 more
openalex   +1 more source

Notes on the diameter of the complement of the power graph of a finite group [PDF]

, 2021
Xuanlong Ma, Alireza Doostabadi, Kaishun Wang   +2 more
openalex   +1 more source

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

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