Show simple item record

dc.contributor.authorGonzález, Antonio
dc.contributor.authorPuertas González, María Luz
dc.date.accessioned2020-01-17T07:54:56Z
dc.date.available2020-01-17T07:54:56Z
dc.date.issued2019-11-15
dc.identifier.issn2227-7390
dc.identifier.urihttp://hdl.handle.net/10835/7486
dc.description.abstractDetermining 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.es_ES
dc.language.isoenes_ES
dc.publisherMDPIes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectgraphes_ES
dc.subjectautomorphism groupes_ES
dc.subjectdetermining numberes_ES
dc.subjectcographes_ES
dc.subjectunit interval graphes_ES
dc.titleRemoving Twins in Graphs to Break Symmetrieses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.relation.publisherversionhttps://www.mdpi.com/2227-7390/7/11/1111es_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internacional