Block graph
id:
block-graph-310-18140104
title:
Block graph
text:
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique. Block graphs are sometimes erroneously called Husimi trees, but that name more properly refers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle. Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph whose biconnected components are all cliques
original url:
https://en.wikipedia.org/wiki/Block_graph
date created:
date modified:
2022-07-10T00:56:02Z
main entity:
{"identifier":"Q4927193","url":"https://www.wikidata.org/entity/Q4927193"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/25/Block_graph.svg","width":351,"height":225}
fields total:
13
integrity:
15