2020-06-172020-06-172019-11-15González Herrera, A. y Puertas González, M.L. (2019). Removing Twins in Graphs to Break Symmetries. Mathematics, 7 (11), 1-13. https://doi.org/10.3390/math7111111.2227-7390https://hdl.handle.net/11441/97966Determining vertex subsets are known tools to provide information about automorphism groups of graphs and, consequently about symmetries of graphs. In this paper, we provide both lower and upper bounds of the minimum size of such vertex subsets, called the determining number of the graph. These bounds, which are performed for arbitrary graphs, allow us to compute the determining number in two different graph families such are cographs and unit interval graphs.application/pdf13 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/GraphAutomorphism groupDetermining numberCographUnit interval graphinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.3390/math7111111