On Dilworth k Graphs and Their Pairwise Compatibility
The Dilworth number of a graph is the size of the largest subset of its nodes in which the close neighborhood of no node contains the neighborhood of another one. In this paper we give a new characterization of Dilworth k graphs, for each value of k, exactly defining their structure. Moreover, we put these graphs in relation with pairwise compatibility graphs (PCGs), i.e. graphs on n nodes that can be generated from an edge-weighted tree T that has n leaves, each representing a different node of the graph; two nodes are adjacent in the graph if and only if the weighted distance in the corresponding T is between two given non-negative real numbers, m and M. When either m or M are not used to eliminate edges from G, the two subclasses leaf power and minimum leaf power graphs (LPGs and mLPGs, respectively) are defined. Here we prove that graphs that are either LPGs or mLPGs of trees obtained connecting the centers of k stars with a path are Dilworth k graphs. We show that the opposite is true when k = 1,2, but not when k ≥ 3. Finally, we show that the relations we proved between Dilworth k graphs and chains of k stars hold only for LPGs and mLPGs, but not for PCGs.
KeywordsGraphs with Dilworth number k leaf power graphs minimum leaf power graphs pairwise compatibility graphs
Unable to display preview. Download preview PDF.
- 1.Belmonte, R., Vatshelle, M.: Graph Classes with Structured Neighborhoods and Algorithmic Applications. Theoretical Computer Science (2013), doi:10.1016/j.tcs.2013.01.011Google Scholar
- 3.Brandstädt, A.: On Leaf Powers. Technical report, University of Rostock (2010)Google Scholar
- 4.Brandstädt, A., Le, V.B., Spinrad, J.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
- 8.Calamoneri, T., Petreschi, R.: Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. Lagos 2013, Electronic Notes in Discrete Mathematics 44, 31–38 (2013)Google Scholar
- 9.Calamoneri, T., Petreschi, R., Sinaimeri, B.: On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. In: Special Issue of WALCOM 2012 on Discrete Mathematics, Algorithms and Applications (DMAA), vol. 5(2) (2013) (to appear)Google Scholar
- 10.Calamoneri, T., Petreschi, R., Sinaimeri, B.: On relaxing the constraints in pairwise compatibility graphs. In: Rahman, M.S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol. 7157, pp. 124–135. Springer, Heidelberg (2012)Google Scholar
- 12.Durocher, S., Mondal, D., Rahman, M.S.: On Graphs that are not PCGs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 310–321. Springer, Heidelberg (2013)Google Scholar
- 17.Kearney, P.E., Corneil, D.G.: Tree powers. J. Algorithms 29(1) (1998)Google Scholar
- 20.Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math., vol. 56. North-Holland, Amsterdam (1995)Google Scholar
- 22.Phillips, D.: Uniform sampling from phylogenetics trees. Masters Thesis, University of Waterloo (2002)Google Scholar
- 24.Yanhaona, M.N., Hossain, K.S.M.T., Rahman, M.S.: Ladder graphs are pairwise compatibility graphs. In: AAAC 2011 (2011)Google Scholar