Abstract
In the present paper, we introduce the notion of graph functionality, which generalizes simultaneously several other graph parameters, such as degeneracy or clique-width, in the sense that bounded degeneracy or bounded clique-width imply bounded functionality. Moreover, we show that this generalization is proper by revealing classes of graphs of unbounded degeneracy and clique-width, where functionality is bounded by a constant. We also prove that bounded functionality implies bounded VC-dimension, i.e. graphs of bounded VC-dimension extend graphs of bounded functionality, and this extension also is proper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Atminas, A., Collins, A., Lozin, V., Zamaraev, V.: Implicit representations and factorial properties of graphs. Discrete Math. 338, 164–179 (2015)
Alon, N., Brightwell, G., Kierstead, H., Kostochka, A., Winkler, P.: Dominating sets in \(k\)-majority tournaments. J. Comb. Theory Ser. B 96, 374–387 (2006)
Balogh, J., Bollobás, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Comb. Theory Ser. B 79, 131–156 (2000)
Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41, 182–208 (1986)
Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci. 46, 218–270 (1993)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33, 125–150 (2000)
Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Appl. Math. 101, 77–114 (2000)
Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11(3), 423–443 (2000)
Gurski, F., Wanke, E.: Line graphs of bounded clique-width. Discrete Math. 307, 2734–2754 (2007)
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: STOC 1988, pp. 334–343 (1988)
Lejeune, M., Lozin, V., Lozina, I., Ragab, A., Yacout, S.: Recent advances in the theory and practice of Logical Analysis of Data. Eur. J. Oper. Res. 275, 1–15 (2019)
Lozin, V.: Minimal classes of graphs of unbounded clique-width. Ann. Comb. 15, 707–722 (2011)
Lozin, V.: Graph parameters and Ramsey theory. Lect. Notes Comput. Sci. 10765, 185–194 (2018)
Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, 19, xiii+342 pp. American Mathematical Society, Providence (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Alecu, B., Atminas, A., Lozin, V. (2019). Graph Functionality. In: Sau, I., Thilikos, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2019. Lecture Notes in Computer Science(), vol 11789. Springer, Cham. https://doi.org/10.1007/978-3-030-30786-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-30786-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30785-1
Online ISBN: 978-3-030-30786-8
eBook Packages: Computer ScienceComputer Science (R0)