Abstract
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 each leaf l u of T corresponds to a vertex u ∈ V and there is an edge (u,v) ∈ E if and only if d min ≤ d T (l u , l v ) ≤ d max where d T (l u , l v ) is the sum of the weights of the edges on the unique path from l u to l v in T. In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where d min = 0 (LPG) and d max = + ∞ (mLPG). In particular, we show that the union of LPG and mLPG does not coincide with the whole class PCG, their intersection is not empty, and that neither of the classes LPG and mLPG is contained in the other. Finally, as the graphs we deal with belong to the more general class of split matrogenic graphs, we focus on this class of graphs for which we try to establish the membership to the PCG class.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brandstädt, A.: On leaf powers. Tech. rep., University of Rostock (2010)
Brandstädt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted directed path graphs are leaf powers. Discrete Math. 310, 897–910 (2010)
Brandstädt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98, 133–138 (2006)
Brandstädt, A., Le, V.B., Sritharan, R.: Structure and linear-time recognition of 4-leaf powers (2008)
Fellows, M.R., Meister, D., Rosamond, F.A., Sritharan, R., Telle, J.A.: Leaf Powers and Their Properties: Using the Trees. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 402–413. Springer, Heidelberg (2008)
Kearney, P.E., Munro, J.I., Phillips, D.: Efficient Generation of Uniform Samples from Phylogenetic Trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 177–189. Springer, Heidelberg (2003)
Kennedy, W., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. J. of Discrete Algorithms 4, 511–525 (2006)
Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers for leaf-labeled trees. J. Algorithms 42, 69–108 (2002)
Phillips, D.: Uniform Sampling From Phylogenetics Trees. Master’s thesis, University of Waterloo (August 2002)
Yanhaona, M.N., Bayzid, M.S., Rahman, M.S.: Discovering pairwise compatibility graphs. Discrete Mathematics, Algorithms and Applications 2, 607–623 (2010)
Yanhaona, M.N., Hossain, K.S.M.T., Rahman, M.S.: Pairwise compatibility graphs. J. Appl. Math. Comput. 30, 479–503 (2009)
Yanhaona, M.N., Hossain, K.S.M.T., Rahman, M.S.: Ladder graphs are pairwise compatibility graphs. Abstract at Asian Association for Algorithms and Computation, AAAC (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calamoneri, T., Petreschi, R., Sinaimeri, B. (2012). On Relaxing the Constraints in Pairwise Compatibility Graphs. In: Rahman, M.S., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2012. Lecture Notes in Computer Science, vol 7157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28076-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-28076-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28075-7
Online ISBN: 978-3-642-28076-4
eBook Packages: Computer ScienceComputer Science (R0)