| http://dbpedia.org/ontology/abstract
|
A gain graph is a graph whose edges are la … 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.ndependent of the orientation of the edge.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://web.archive.org/web/20100912123133/http:/www.combinatorics.org/Surveys/index.html +
|
| http://dbpedia.org/ontology/wikiPageID
|
5297369
|
| http://dbpedia.org/ontology/wikiPageLength
|
4816
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1093648882
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Geometry +
, http://dbpedia.org/resource/Graph_embedding +
, http://dbpedia.org/resource/Topological_graph_theory +
, http://dbpedia.org/resource/Spin_glass +
, http://dbpedia.org/resource/Biased_graph +
, http://dbpedia.org/resource/Signed_graph +
, http://dbpedia.org/resource/Hyperplane +
, http://dbpedia.org/resource/Generalized_network +
, http://dbpedia.org/resource/Group_action_%28mathematics%29 +
, http://dbpedia.org/resource/Matroid_theory +
, http://dbpedia.org/resource/Physics +
, http://dbpedia.org/resource/Combinatorial_optimization +
, http://dbpedia.org/resource/Thomas_Zaslavsky +
, http://dbpedia.org/resource/Category:Extensions_and_generalizations_of_graphs +
, http://dbpedia.org/resource/Category:Matroid_theory +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Network_with_gains +
, http://dbpedia.org/resource/Flow_network +
, http://dbpedia.org/resource/Group_%28mathematics%29 +
, http://dbpedia.org/resource/Voltage_graph +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Extensions_and_generalizations_of_graphs +
, http://dbpedia.org/resource/Category:Matroid_theory +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Graph +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Gain_graph?oldid=1093648882&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Gain_graph +
|
| owl:sameAs |
https://global.dbpedia.org/id/4jqEc +
, http://yago-knowledge.org/resource/Gain_graph +
, http://dbpedia.org/resource/Gain_graph +
, http://www.wikidata.org/entity/Q5517214 +
, http://rdf.freebase.com/ns/m.0dd600 +
|
| rdf:type |
http://dbpedia.org/class/yago/Delay115272029 +
, http://dbpedia.org/class/yago/TimeInterval115269513 +
, http://dbpedia.org/class/yago/Measure100033615 +
, http://dbpedia.org/class/yago/Extension115272382 +
, http://dbpedia.org/class/yago/Pause115271008 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/WikicatExtensionsAndGeneralizationsOfGraphs +
|
| rdfs:comment |
A gain graph is a graph whose edges are la … 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). two elements. See Zaslavsky (1989, 1991).
|
| rdfs:label |
Gain graph
|
