Pairwise compatibility graph
id:
pairwise-compatibility-graph-289-7724672
title:
Pairwise compatibility graph
text:
In graph theory, a graph G is a pairwise compatibility graph (PCG) if there exists a tree T and two non-negative real numbers d m i n < d m a x such that each node u ′ of G has a one-to-one mapping with a leaf node u of T such that two nodes u ′ and v ′ are adjacent in G if and only if the distance between u and v are in the interval [ d m i n , d m a x ] . The subclasses of PCG include graphs of at most seven vertices, cycles, forests, complete graphs, interval graphs and ladder graphs. However
brand slug:
wiki
category slug:
encyclopedia
description:
A graph class
original url:
https://en.wikipedia.org/wiki/Pairwise_compatibility_graph
date created:
date modified:
2023-09-01T20:47:09Z
main entity:
{"identifier":"Q111169660","url":"https://www.wikidata.org/entity/Q111169660"}
image:
fields total:
13
integrity:
14