Discovering pairwise compatibility graphs

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let T be an edge weighted tree, let d T (u,v) be the sum of the weights of the edges on the path from u to v in T, and let d min and d max be two non-negative real numbers such that d min ≤ d max . Then a pairwise compatibility graph of T for d min and d max is a graph G=(V,E), where each vertex u ε V corresponds to a leaf u of T and there is an edge (u ε v) E if and only if d min ≤d T (u, v)≤d max . A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers d min and d max such that G is a pairwise compatibility graph of T for d min and d max . Kearney et al. conjectured that every graph is a PCG [3]. In this paper, we refute the conjecture by showing that not all graphs are PCGs. We also show that the well known tree power graphs and some of their extensions are PCGs. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yanhaona, M. N., Bayzid, M. S., & Rahman, M. S. (2010). Discovering pairwise compatibility graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6196 LNCS, pp. 399–408). https://doi.org/10.1007/978-3-642-14031-0_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free