Show simple item record

dc.contributor.authorKlavžar, Sandi
dc.contributor.authorKuziak, Dorota 
dc.contributor.authorPeterin, Iztok
dc.contributor.authorGonzález Yero, Ismael 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2024-02-08T14:51:35Z
dc.date.available2024-02-08T14:51:35Z
dc.date.issued2021-08-23
dc.identifier.issn1807-0302
dc.identifier.urihttp://hdl.handle.net/10498/30895
dc.description.abstractLet $G$ be a graph. The Steiner distance of $W\subseteq V(G)$ is the minimum size of a connected subgraph of $G$ containing $W$. Such a subgraph is necessarily a tree called a Steiner $W$-tree. The set $A\subseteq V(G)$ is a $k$-Steiner general position set if $V(T_B)\cap A = B$ holds for every set $B\subseteq A$ of cardinality $k$, and for every Steiner $B$-tree $T_B$. The $k$-Steiner general position number $\sgp_k(G)$ of $G$ is the cardinality of a largest $k$-Steiner general position set in $G$. Steiner cliques are introduced and used to bound $\sgp_k(G)$ from below. The $k$-Steiner general position number is determined for trees, cycles and joins of graphs. Lower bounds are presented for split graphs, infinite grids and lexicographic products. The lower bound for the latter product leads to an exact formula for the general position number of an arbitrary lexicographic product.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherSpringeres_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceComputational and Applied Mathematics - 2021, Vol. 40 n.6 article # 223es_ES
dc.subjectSteiner distancees_ES
dc.subjectSteiner general position setes_ES
dc.subjectSteiner general position numberes_ES
dc.subjectjoin of graphses_ES
dc.subjectlexicographic product of graphses_ES
dc.titleA Steiner general position problem in graph theoryes_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1007/s40314-021-01619-y
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-105824GB-I00/ES/OPTIMIZACION MATEMATICA Y COMBINATORIA EN REDES/ es_ES
dc.type.hasVersionAMes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
This work is under a Creative Commons License Attribution-NonCommercial-NoDerivatives 4.0 Internacional