Results 11 to 20 of about 326,613 (309)
Voltage Lifts of Graphs from a Category Theory Viewpoint [PDF]
Mathematica Slovaca, 2023 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
Critical groups of covering, voltage, and signed graphs [PDF]
Discrete Mathematics, 2013 Version 3 fixes a typo, and adds some details in the proof of Theorem 1 ...
Victor Reiner, Dennis Tseng
openalex +3 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
Applications Of Ordinary Voltage Graph Theory To Graph Embeddability,\n 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
openalex +3 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
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
Hitting Times of Walks on Graphs through Voltages [PDF]
Journal of Probability, 2014 We derive formulas for the expected hitting times of general random walks on graphs, in terms of voltages, with very elementary electric means. Under this new light we revise bounds and hitting times for birth-and-death Markov chains and for walks on graphs with cutpoints, and give some exact computations on the necklace graph.
José Luis Palacios +2 more
openalex +2 more sources
Physics, 2020 This paper proposes a method for examining chaotic structures in semiconductor or alloy voltage oscillation time-series, and focuses on the case of the TlInTe2 semiconductor.
Dimitrios Tsiotas +2 more
doaj +1 more source
IET Generation, Transmission & Distribution, 2022 The increasing use of distributed generation (DG) in power systems can result in frequent online voltage problems. In scenarios in which substantial DG prediction errors occur because of high DG accommodation levels, traditional technical solutions ...
Peng Xu +3 more
doaj +1 more source
Some voltage graph-based LDPC tailbiting codes with large girth [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short ...
Irina E. Bocharova +4 more
openalex +4 more sources