Gain graph (original) (raw)
A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G. This means that, if an edge e in one direction has label g (a group element), then in the other direction it has label g −1. The label function φ therefore has the property that it is defined differently, but not independently, on the two different orientations, or directions, of an edge e. The group G is called the gain group, φ is the gain function, and the value φ(e) is the gain of e (in some indicated direction). A gain graph is a generalization of a signed graph, where the gain group G has only two elements. See Zaslavsky (1989, 1991).
| Property | Value |
|---|---|
| dbo:abstract | A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G. This means that, if an edge e in one direction has label g (a group element), then in the other direction it has label g −1. The label function φ therefore has the property that it is defined differently, but not independently, on the two different orientations, or directions, of an edge e. The group G is called the gain group, φ is the gain function, and the value φ(e) is the gain of e (in some indicated direction). A gain graph is a generalization of a signed graph, where the gain group G has only two elements. See Zaslavsky (1989, 1991). A gain should not be confused with a weight on an edge, whose value is independent of the orientation of the edge. (en) |
| dbo:wikiPageExternalLink | https://web.archive.org/web/20100912123133/http:/www.combinatorics.org/Surveys/index.html |
| dbo:wikiPageID | 5297369 (xsd:integer) |
| dbo:wikiPageLength | 4816 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1093648882 (xsd:integer) |
| dbo:wikiPageWikiLink | dbc:Matroid_theory dbr:Biased_graph dbr:Voltage_graph dbr:Signed_graph dbc:Extensions_and_generalizations_of_graphs dbr:Geometry dbr:Graph_(discrete_mathematics) dbr:Combinatorial_optimization dbr:Physics dbr:Flow_network dbr:Graph_embedding dbr:Spin_glass dbr:Group_(mathematics) dbr:Group_action_(mathematics) dbr:Hyperplane dbr:Thomas_Zaslavsky dbr:Generalized_network dbr:Topological_graph_theory dbr:Matroid_theory dbr:Network_with_gains |
| dbp:wikiPageUsesTemplate | dbt:Short_description |
| dcterms:subject | dbc:Matroid_theory dbc:Extensions_and_generalizations_of_graphs |
| gold:hypernym | dbr:Graph |
| rdf:type | dbo:Software yago:Abstraction100002137 yago:Delay115272029 yago:Extension115272382 yago:Measure100033615 yago:Pause115271008 yago:TimeInterval115269513 yago:WikicatExtensionsAndGeneralizationsOfGraphs |
| rdfs:comment | A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G. This means that, if an edge e in one direction has label g (a group element), then in the other direction it has label g −1. The label function φ therefore has the property that it is defined differently, but not independently, on the two different orientations, or directions, of an edge e. The group G is called the gain group, φ is the gain function, and the value φ(e) is the gain of e (in some indicated direction). A gain graph is a generalization of a signed graph, where the gain group G has only two elements. See Zaslavsky (1989, 1991). (en) |
| rdfs:label | Gain graph (en) |
| owl:sameAs | freebase:Gain graph yago-res:Gain graph wikidata:Gain graph https://global.dbpedia.org/id/4jqEc |
| prov:wasDerivedFrom | wikipedia-en:Gain_graph?oldid=1093648882&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Gain_graph |
| is dbo:wikiPageRedirects of | dbr:Gain_group |
| is dbo:wikiPageWikiLink of | dbr:Bicircular_matroid dbr:Biased_graph dbr:Voltage_graph dbr:Dowling_geometry dbr:Signed_graph dbr:Trace_diagram dbr:Graph_coloring dbr:Matroid dbr:Gain_group dbr:Flow_network dbr:Group_action |
| is foaf:primaryTopic of | wikipedia-en:Gain_graph |