Show simple item record

dc.contributor.authorLópez Masip, Susana-Clara
dc.date.accessioned2019-06-14T11:43:20Z
dc.date.available2019-06-14T11:43:20Z
dc.date.issued2013
dc.identifier.issn0166-218X
dc.identifier.urihttp://hdl.handle.net/10459.1/66454
dc.description.abstractWe give an upper bound for the size of non-trivial sets that have small boundary in a family of arc-transitive digraphs. We state the exact size for these sets in case of prime degree. We also give a lower bound for the size of a minimum non-trivial cutset in the case of arc-transitive Cayley digraphs of prime degree.
dc.description.sponsorshipResearch supported by the Spanish Research Council under project MTM2011-28800-C02-01 and by the Catalan Research Council under grant 2009SGR1387.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherElsevier
dc.relationMICINN/PN2008-2011/MTM2011-28800-C02-01
dc.relation.isformatofVersió postprint del document publicat a: https://doi.org/10.1016/j.dam.2013.02.005
dc.relation.ispartofDiscrete Applied Mathematics, 2013, vol. 161, num. 10-11, p. 1639-1645
dc.rightscc-by-nc-nd (c) Elsevier, 2013
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectArc-transitive
dc.subjectCayley digraph
dc.subject2-atom
dc.subjectVosperian
dc.titleSmall cutsets in arc-transitive digraphs of prime degree
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-06-14T11:43:22Z
dc.identifier.idgrec028490
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.1016/j.dam.2013.02.005


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Elsevier, 2013
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Elsevier, 2013