Show simple item record

dc.contributor.authorKlavžar, Sandi
dc.contributor.authorPatkós, Balázs
dc.contributor.authorRus, Gregor
dc.contributor.authorGonzález Yero, Ismael 
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2022-03-25T07:33:27Z
dc.date.available2022-03-25T07:33:27Z
dc.date.issued2021-08
dc.identifier.issn1422-6383
dc.identifier.issn1420-9012
dc.identifier.urihttp://hdl.handle.net/10498/26516
dc.description.abstractThe general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets are refereed to as gpsets of G. The general position number of cylinders Pr square Cs is deduced. It is proved that gp(Cr square C-s). {6, 7} whenever r >= s = 3, s >=not equal 4, and r >= 6. A probabilistic lower bound on the general position number of Cartesian graph powers is achieved. Along the way a formula for the number of gp-sets in Pr square Ps, where r, s >= 2, is also determined.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherSPRINGER BASEL AGes_ES
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceResults Math 76, 123 (2021)es_ES
dc.subjectGeneral position problemes_ES
dc.subjectCartesian product of graphses_ES
dc.subjectpaths and cycleses_ES
dc.subjectprobabilistic constructionses_ES
dc.subjectexact enumerationes_ES
dc.titleOn General Position Sets in Cartesian Productses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1007/s00025-021-01438-x


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución 4.0 Internacional
This work is under a Creative Commons License Atribución 4.0 Internacional