Results 1 to 10 of about 1,307,438 (325)
Persistent homology in graph power filtrations [PDF]
Royal 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]
Discrete 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 +4 more sources
Conceptual design of a decision knowledge service model integrating a multi-agent supply relationship diagram for electric power emergency equipment [PDF]
Frontiers in Big DataIntroductionThe decision regarding the supply of emergency equipments for power emergencies requires timeliness, efficiency, and accuracy. The multi-agent supply relationship graph, based on complex data fusion, enables the comprehensive exploration of ...
Jiandong Si +7 more
doaj +2 more sources
The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]
Notes 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 +1 more source
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
Discrete 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
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) of a finite group
BUBBOLONI, DANIELA +2 more
openaire +4 more sources
Graph Powers and Graph Homomorphisms [PDF]
The 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+
Ali Taherkhani, Hossein Hajiabolhassan
openaire +3 more sources
Construction Technology of Knowledge Graph and its Application in Power Grid [PDF]
E3S Web of Conferences, 2021 With the rapid development of energy internet, dispatchers need to learn more knowledge with wider scope and fast update speed. It’s urgent to realize the knowledge electrification, knowledge systematization, knowledge visualization and knowledge sharing
Xiaoping Gai +5 more
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
Permutational Powers of a Graph [PDF]
The Electronic Journal of Combinatorics, 2019 This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Daniele D'Angeli +2 more
openaire +3 more sources