{"id":"https://openalex.org/W7129575050","doi":"https://doi.org/10.48550/arxiv.2602.13781","title":"Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs","display_name":"Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs","publication_year":2026,"publication_date":"2026-02-14","ids":{"openalex":"https://openalex.org/W7129575050","doi":"https://doi.org/10.48550/arxiv.2602.13781"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.13781","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126243608","display_name":"Shanshan Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yu, Shanshan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003695209","display_name":"Yuefang Sun","orcid":"https://orcid.org/0000-0002-7515-8481"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yuefang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126243608"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9002000093460083,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9002000093460083,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.035999998450279236,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.025699999183416367,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8461999893188477},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.7793999910354614},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6532999873161316},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5511999726295471},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5202999711036682},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.49939998984336853}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8740000128746033},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8461999893188477},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.7793999910354614},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6532999873161316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6097999811172485},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5511999726295471},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.4587000012397766},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38190001249313354},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2648000121116638}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.13781","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.13781","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.13781","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.13781","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"$D=(V(D),A(D))$":[1],"be":[2],"a":[3,6,26,92,127],"digraph":[4,104],"with":[5],"terminal":[7],"vertex":[8],"subset":[9],"$S\\subseteq":[10],"V(D)$":[11],"such":[12],"that":[13],"$|S|=k\\geq":[14],"2$.":[15],"An":[16],"out-tree":[17],"$T$":[18],"of":[19,65,80,100],"$D$":[20,66,108],"rooted":[21],"at":[22],"$r$":[23],"is":[24,67],"called":[25],"directed":[27],"pendant":[28,32,48,83,133],"$(S,r)$-Steiner":[29],"tree":[30],"(or,":[31],"$(S,r)$-tree":[33],"for":[34,42,96,130],"short)":[35],"if":[36,55],"$r\\in":[37],"S\\subseteq":[38,71],"V(T)$":[39],"and":[40,51,58,109],"$d_{T}^{+}(r)=d_{T}^{-}(u)=1$":[41],"each":[43],"$u\\in":[44],"S\\backslash":[45],"\\{r\\}$.":[46],"Two":[47],"$(S,r)$-trees":[49,84,134],"$T_{1}$":[50],"$T_{2}$":[52],"are":[53,111],"internally-disjoint":[54,82,132],"$A(T_{1})\\cap":[56],"A(T_{2})=\\varnothing$":[57],"$V(T_{1})\\cap":[59],"V(T_{2})=S$.":[60],"The":[61],"pendant-tree":[62,98],"$k$-connectivity":[63],"$\u03c4_{k}(D)$":[64],"defined":[68],"as":[69],"$$\u03c4_{k}(D)=\\min\\{\u03c4_{S,r}(D)\\mid":[70],"V(D),|S|=k,r\\in":[72],"S\\},$$":[73],"where":[74,107],"$\u03c4_{S,r}(D)$":[75],"denotes":[76],"the":[77,97,101,118],"maximum":[78],"number":[79],"pairwise":[81],"in":[85],"$D$.":[86],"In":[87],"this":[88,137],"paper,":[89],"we":[90,116,125],"derive":[91],"sharp":[93],"lower":[94,119,138],"bound":[95,120],"3-connectivity":[99],"Cartesian":[102],"product":[103],"$D\\square":[105],"H$,":[106],"$H$":[110],"both":[112],"strong":[113],"digraphs.":[114],"Specifically,":[115],"prove":[117],"$\u03c4_{3}(D\\square":[121],"H)\\geq":[122],"\u03c4_{3}(D)+\u03c4_{3}(H)$.":[123],"Moreover,":[124],"propose":[126],"polynomial-time":[128],"algorithm":[129],"finding":[131],"which":[135],"attain":[136],"bound.":[139]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-18T00:00:00"}