Results 1 to 10 of about 1,356,811 (224)

The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]

open access: diamondNotes on Number Theory and Discrete Mathematics, 2023
The undirected P(Zₙ) power graph of a finite group of Zₙ is a connected graph, the set of vertices of which is Zₙ. Here u,v∈P(Zₙ) are two diverse adjacent vertices if and only if u≠v and ⟨v⟩ ⊆ ⟨u⟩ or ⟨u⟩ ⊆ ⟨v⟩.
Volkan Aşkin
doaj   +2 more sources

Persistent homology in graph power filtrations [PDF]

open access: yesRoyal Society Open Science, 2016
The persistence of homological features in simplicial complex representations of big datasets in Rn resulting from Vietoris–Rips or Čech filtrations is commonly used to probe the topological structure of such datasets.
Allen D. Parks, David J. Marchette
doaj   +2 more sources

Power domination in maximal planar graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.
Paul Dorbec   +2 more
doaj   +5 more sources

Dynamic graph structure and spatio-temporal representations in wind power forecasting [PDF]

open access: diamondScience and Technology for Energy Transition
Wind Power Forecasting (WPF) has gained considerable focus as a crucial aspect of the successful integration and operation of wind power. However, due to the stochastic and unstable nature of wind, it poses a real challenge to effectively analyze the ...
Zang Peng   +3 more
doaj   +2 more sources

Adaptive power flow analysis for power system operation based on graph deep learning

open access: goldInternational Journal of Electrical Power & Energy Systems
Conventional model-driven methods are hard to handle large-scale power flow with multivariate uncertainty, variable topology, and massive real-time repetitive calculations.
Xiao Hu   +6 more
doaj   +2 more sources

Graph Powers and Graph Homomorphisms [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hajiabolhassan, Hossein, Taherkhani, Ali
openaire   +3 more sources

SOME GRAPH PARAMETERS OF POWER SET GRAPHS

open access: yesAdvances and Applications in Discrete Mathematics, 2021
In this study, we examine some graph parameters such as the edge number, chromatic number, girth, domination number and clique number of power set graphs.
Cangül, İsmail Naci   +3 more
openaire   +2 more sources

Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj   +1 more source

Chain graph reduction into power chain graphs

open access: yesQuantitative and Computational Methods in Behavioral Sciences, 2021
Reduction of graphs is a class of procedures used to decrease the dimensionality of a given graph in which the properties of the reduced graph are to be induced from the properties of the larger original graph. This paper introduces both a new method for reducing chain graphs to simpler directed acyclic graphs (DAGs), that we call power chain graphs ...
Víthor Rosa Franco   +3 more
openaire   +3 more sources

Forbidden Subgraphs of Power Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2021
The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$.
Manna, Pallabi   +2 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy