Sachs subgraph
id:
sachs-subgraph-300-11556708
title:
Sachs subgraph
text:
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 permanental polynomials of graphs. Sachs subgraphs and the polynomials calculated with their aid have been applied in chemical graph theory, for instance as par
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Sachs_subgraph
date created:
date modified:
2020-10-08T06:07:42Z
main entity:
{"identifier":"Q104860083","url":"https://www.wikidata.org/entity/Q104860083"}
image:
fields total:
13
integrity:
13