On Graphs That Are Not PCGs
Let T be an edge weighted tree and let d min ,d max be two nonnegative real numbers. Then the pairwise compatibility graph (PCG) of T is a graph G such that each vertex of G corresponds to a distinct leaf of T and two vertices are adjacent in G if and only if the weighted distance between their corresponding leaves in T is in the interval [d min ,d max ]. Similarly, a given graph G is a PCG if there exist suitable T,d min ,d max , such that G is a PCG of T. Yanhaona, Bayzid and Rahman proved that there exists a graph with 15 vertices that is not a PCG. On the other hand, Calamoneri, Frascaria and Sinaimeri proved that every graph with at most seven vertices is a PCG. In this paper we construct a graph of eight vertices that is not a PCG, which strengthens the result of Yanhaona, Bayzid and Rahman, and implies optimality of the result of Calamoneri, Frascaria and Sinaimeri. We then construct a planar graph with sixteen vertices that is not a PCG. Finally, we prove a variant of the PCG recognition problem to be NP-complete.
Unable to display preview. Download preview PDF.
- 4.Calamoneri, T., Frascaria, D., Sinaimeri, B.: All graphs with at most seven vertices are pairwise compatibility graphs. The Computer Journal (to appear, 2012), http://arxiv.org/abs/1202.4631
- 11.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)Google Scholar