Removing Twins in Graphs to Break Symmetries
Determining 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 boun...
Main Authors: | , |
---|---|
Format: | info:eu-repo/semantics/article |
Language: | English |
Published: |
MDPI
2020
|
Subjects: | |
Online Access: | http://hdl.handle.net/10835/7486 |
_version_ | 1789406561387413504 |
---|---|
author | González, Antonio Puertas González, María Luz |
author_facet | González, Antonio Puertas González, María Luz |
author_sort | González, Antonio |
collection | DSpace |
description | Determining 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. |
format | info:eu-repo/semantics/article |
id | oai:repositorio.ual.es:10835-7486 |
institution | Universidad de Cuenca |
language | English |
publishDate | 2020 |
publisher | MDPI |
record_format | dspace |
spelling | oai:repositorio.ual.es:10835-74862023-04-12T19:38:25Z Removing Twins in Graphs to Break Symmetries González, Antonio Puertas González, María Luz graph automorphism group determining number cograph unit interval graph Determining 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. 2020-01-17T07:54:56Z 2020-01-17T07:54:56Z 2019-11-15 info:eu-repo/semantics/article 2227-7390 http://hdl.handle.net/10835/7486 en https://www.mdpi.com/2227-7390/7/11/1111 Attribution-NonCommercial-NoDerivatives 4.0 Internacional http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess MDPI |
spellingShingle | graph automorphism group determining number cograph unit interval graph González, Antonio Puertas González, María Luz Removing Twins in Graphs to Break Symmetries |
title | Removing Twins in Graphs to Break Symmetries |
title_full | Removing Twins in Graphs to Break Symmetries |
title_fullStr | Removing Twins in Graphs to Break Symmetries |
title_full_unstemmed | Removing Twins in Graphs to Break Symmetries |
title_short | Removing Twins in Graphs to Break Symmetries |
title_sort | removing twins in graphs to break symmetries |
topic | graph automorphism group determining number cograph unit interval graph |
url | http://hdl.handle.net/10835/7486 |
work_keys_str_mv | AT gonzalezantonio removingtwinsingraphstobreaksymmetries AT puertasgonzalezmarialuz removingtwinsingraphstobreaksymmetries |