Voltage graph
http://dbpedia.org/resource/Voltage_graph an entity of type: Software
In graph theory, a voltage graph is a directed graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally used in topological graph theory as a concise way to specify another graph called the derived graph of the voltage graph.
rdf:langString
rdf:langString
Voltage graph
xsd:integer
8802504
xsd:integer
1093627004
rdf:langString
In graph theory, a voltage graph is a directed graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally used in topological graph theory as a concise way to specify another graph called the derived graph of the voltage graph. Typical choices of the groups used for voltage graphs include the two-element group ℤ2 (for defining the bipartite double cover of a graph), free groups (for defining the universal cover of a graph), d-dimensional integer lattices ℤd (viewed as a group under vector addition, for defining periodic structures in d-dimensional Euclidean space), and finite cyclic groups ℤn for n > 2. When Π is a cyclic group, the voltage graph may be called a cyclic-voltage graph.
xsd:nonNegativeInteger
7243