Results 1 to 10 of about 328,145 (308)
Trajectories entropy in dynamical graphs with memory [PDF]
Frontiers in Robotics and AI, 2016 In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific ...
Francesco eCaravelli
doaj +4 more sources
Generalised voltage graphs [PDF]
European Journal of Combinatorics, 2021 A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of graphs with a significant degree of symmetry.
Primož Potočnik, Micael Toledo
openalex +4 more sources
Voltage Graphs, Group Presentations and Cages [PDF]
The Electronic Journal of Combinatorics, 2004 We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations.
Geoffrey Exoo
openalex +3 more sources
Applications Of Ordinary Voltage Graph Theory To Graph Embeddability, Part 1 [PDF]
, 2015 We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of the cycle space of a cellularly embedded graph.
Steven Schluchter
+5 more sources
Lifting Voltages in Graph Covers [PDF]
We consider voltage digraphs, here referred to as graphs, whose edges are labeled with elements from a given group, and explore their derived graphs. Given two voltage graphs, with voltages in abelian groups, we establish a necessary and sufficient condition for their two derived graphs to be isomorphic.
Natasha Jonoska +2 more
openalex +3 more sources
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications [PDF]
Journal of Graph Theory, 2014 AbstractIn an earlier article the authors constructed a hamilton cycle embedding of in a nonorientable surface for all and then used these embeddings to determine the genus of some large families of graphs. In this two‐part series, we extend those results to orientable surfaces for all .
M. N. Ellingham, Justin Z. Schroeder
openalex +2 more sources
Voltage lifts of graphs from a category theory viewpoint [PDF]
Mathematica Slovaca, 2020 ABSTRACT We prove that the notion of a voltage graph lift comes from an adjunction between the category of voltage graphs and the category of group labeled graphs.
Gejza Jenča
openalex +3 more sources
Design of Zero Voltage Switching Boost DC-DC Converter Using Bond Graph Model
Emitter: International Journal of Engineering Technology, 2020 The research in power supply design is moving towards improving efficiency by reducing losses. Another aspect of research in power converters is its modeling as it involves multiple domains such as electrical, mechanical, magnetic...etc.
Shaik Hussain Vali, R Kiranmayi
doaj +3 more sources
Graph Neural Networks for Voltage Stability Margins With Topology Flexibilities
IEEE Open Access Journal of Power and Energy, 2023 High penetration of distributed energy resources (DERs) changes the flows in power grids causing thermal congestions which are managed by real-time corrective topology switching.
Kishan Prudhvi Guddanti +4 more
doaj +2 more sources
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth [PDF]
IEEE Transactions on Information Theory, 2011 The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found. Bounds on the girth and the minimum
Irina E. Bocharova +4 more
openalex +6 more sources