About: Sachs subgraph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, a Sachs subgraph of a given graph is a subgraph in which all connected components are either single edges or cycles. These subgraphs are named after Horst Sachs, who used them in an expansion of the characteristic polynomial of the adjacency matrix of graphs. A similar expansion using Sachs subgraphs is also possible for of graphs. Sachs subgraphs and the polynomials calculated with their aid have been applied in chemical graph theory, for instance as part of a test for the existence of non-bonding orbitals in hydrocarbon structures.

Property Value
dbo:abstract
  • In graph theory, a Sachs subgraph of a given graph is a subgraph in which all connected components are either single edges or cycles. These subgraphs are named after Horst Sachs, who used them in an expansion of the characteristic polynomial of the adjacency matrix of graphs. A similar expansion using Sachs subgraphs is also possible for of graphs. Sachs subgraphs and the polynomials calculated with their aid have been applied in chemical graph theory, for instance as part of a test for the existence of non-bonding orbitals in hydrocarbon structures. A spanning Sachs subgraph, also called a {1,2}-factor, is a Sachs subgraph in which every vertex of the given graph is incident to an edge of the subgraph. The union of two perfect matchings is always a bipartite spanning Sachs subgraph, but in general Sachs subgraphs are not restricted to being bipartite. Some authors use the term "Sachs subgraph" to mean only spanning Sachs subgraphs. (en)
dbo:wikiPageID
  • 65455145 (xsd:integer)
dbo:wikiPageLength
  • 3421 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 982447073 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory, a Sachs subgraph of a given graph is a subgraph in which all connected components are either single edges or cycles. These subgraphs are named after Horst Sachs, who used them in an expansion of the characteristic polynomial of the adjacency matrix of graphs. A similar expansion using Sachs subgraphs is also possible for of graphs. Sachs subgraphs and the polynomials calculated with their aid have been applied in chemical graph theory, for instance as part of a test for the existence of non-bonding orbitals in hydrocarbon structures. (en)
rdfs:label
  • Sachs subgraph (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License