Strangulated graph
id:
strangulated-graph-202-14641542
title:
Strangulated graph
text:
In graph theoretic mathematics, a strangulated graph is a graph in which deleting the edges of any induced cycle of length greater than three would disconnect the remaining graph. That is, they are the graphs in which every peripheral cycle is a triangle.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph whose peripheral cycles are all triangles
original url:
https://en.wikipedia.org/wiki/Strangulated_graph
date created:
date modified:
2022-07-06T21:48:34Z
main entity:
{"identifier":"Q7621644","url":"https://www.wikidata.org/entity/Q7621644"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/56/Strangulated_graph.svg","width":351,"height":234}
fields total:
13
integrity:
15