{"id":"https://openalex.org/W2962898528","doi":"https://doi.org/10.48550/arxiv.1012.5710","title":"The generalized connectivity of complete bipartite graphs","display_name":"The generalized connectivity of complete bipartite graphs","publication_year":2010,"publication_date":"2010-12-28","ids":{"openalex":"https://openalex.org/W2962898528","doi":"https://doi.org/10.48550/arxiv.1012.5710","mag":"2962898528"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1012.5710","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.5710","pdf_url":"https://arxiv.org/pdf/1012.5710","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2962898528"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1012.5710","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100376032","display_name":"Shasha Li","orcid":"https://orcid.org/0000-0003-2706-0399","observed_orcids":["https://orcid.org/0000-0003-2706-0399"]},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Shasha","raw_affiliation_strings":["Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","Nankai University;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"Nankai University;","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067044215","display_name":"Wei Li","orcid":"https://orcid.org/0000-0001-8304-3660","observed_orcids":["https://orcid.org/0000-0001-8304-3660"]},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Wei","raw_affiliation_strings":["Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","Nankai University;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"Nankai University;","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100365966","display_name":"Xueliang Li","orcid":"https://orcid.org/0000-0002-8335-9873","observed_orcids":["https://orcid.org/0000-0002-8335-9873"]},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Xueliang","raw_affiliation_strings":["Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","Nankai University;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC-TJKLC Nankai University , Tianjin 300071 , China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"Nankai University;","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205237279"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":62,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"104","issue":null,"first_page":"65","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8515999913215637,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8515999913215637,"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/T11476","display_name":"Graph theory and applications","score":0.09560000151395798,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.014999999664723873,"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/k-connectivity","display_name":"k-connectivity","score":0.8420000076293945},{"id":"https://openalex.org/keywords/complete-bipartite-graphs","display_name":"complete bipartite graphs","score":0.9980000257492065},{"id":"https://openalex.org/keywords/edge-disjoint-spanning-trees","display_name":"edge-disjoint spanning trees","score":0.9980000257492065},{"id":"https://openalex.org/keywords/graph-connectivity","display_name":"graph connectivity","score":0.6370000243186951},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"extremal graph theory","score":0.5440000295639038}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9010995626449585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7942355275154114},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7224520444869995},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7114863395690918},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5843814015388489},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4817390739917755},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4388981759548187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4350837767124176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06961232423782349},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1012.5710","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.5710","pdf_url":"https://arxiv.org/pdf/1012.5710","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1012.5710","doi":"https://doi.org/10.48550/arxiv.1012.5710","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1012.5710","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2962898528","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/arscom/arscom104.html#LiLL12","pdf_url":null,"source":{"id":"https://openalex.org/S73158690","display_name":"Ars Combinatoria","issn_l":"0381-7032","issn":["0381-7032","2817-5204"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","poland-20","russia-white-list-4"],"host_organization":"https://openalex.org/P4323439501","host_organization_name":"Charles Babbage Research Centre","host_organization_lineage":["https://openalex.org/P4323439501"],"host_organization_lineage_names":["Charles Babbage Research Centre"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Ars Combinatoria","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1012.5710","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.5710","pdf_url":"https://arxiv.org/pdf/1012.5710","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962898528.pdf","grobid_xml":"https://content.openalex.org/works/W2962898528.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1994906602","https://openalex.org/W2010142885","https://openalex.org/W2154039222","https://openalex.org/W2605946054","https://openalex.org/W2611093227"],"related_works":["https://openalex.org/W4401815469","https://openalex.org/W4401958505","https://openalex.org/W3193326227","https://openalex.org/W7098326636","https://openalex.org/W111746420","https://openalex.org/W2019952679","https://openalex.org/W7214036203","https://openalex.org/W4398137226","https://openalex.org/W4393034771","https://openalex.org/W7124258042"],"abstract_inverted_index":{"Let":[0],"$G$":[1,39,71],"be":[2],"a":[3,19],"nontrivial":[4],"connected":[5],"graph":[6],"of":[7,22,25,34,48,61,70,85,94,102,106,115,125,129,151],"order":[8],"$n$,":[9],"and":[10,134,162,170,176],"$k$":[11,23],"an":[12],"integer":[13],"with":[14,51],"$2\\leq":[15,155],"k\\leq":[16],"n$.":[17],"For":[18],"set":[20],"$S$":[21,84],"vertices":[24],"$G$,":[26],"let":[27],"$\u03ba(S)$":[28],"denote":[29],"the":[30,59,77,92,99,113,123,137,149],"maximum":[31,100],"number":[32,101,124],"$\\ell$":[33],"edge-disjoint":[35,103,126,139],"trees":[36,105,128],"$T_1,T_2,...,T_\\ell$":[37],"in":[38],"such":[40],"that":[41],"$V(T_i)\\cap":[42],"V(T_j)=S$":[43],"for":[44,153],"every":[45],"pair":[46],"$i,j$":[47],"distinct":[49],"integers":[50],"$1\\leq":[52],"i,j\\leq":[53],"\\ell$.":[54],"Chartrand":[55],"et":[56],"al.":[57],"generalized":[58],"concept":[60],"connectivity":[62,93],"as":[63],"follows:":[64],"The":[65],"$k$-$connectivity$,":[66],"denoted":[67],"by":[68,74],"$\u03ba_k(G)$,":[69],"is":[72,79,91,98,132,164,172],"defined":[73],"$\u03ba_k(G)=$min$\\{\u03ba(S)\\}$,":[75],"where":[76,89],"minimum":[78],"taken":[80],"over":[81],"all":[82,154],"$k$-subsets":[83],"$V(G)$.":[86],"Thus":[87],"$\u03ba_2(G)=\u03ba(G)$,":[88],"$\u03ba(G)$":[90],"$G$.":[95,107],"Moreover,":[96],"$\u03ba_{n}(G)$":[97],"spanning":[104,127,140],"This":[108],"paper":[109],"mainly":[110],"focus":[111],"on":[112,144],"$k$-connectivity":[114,150],"complete":[116],"bipartite":[117],"graphs":[118],"$K_{a,b}$.":[119],"First,":[120],"we":[121,147],"obtain":[122],"$K_{a,b}$,":[130],"which":[131],"$\\lfloor\\frac{ab}{a+b-1}\\rfloor$,":[133],"specifically":[135],"give":[136],"$\\lfloor\\frac{ab}{a+b-1}\\rfloor$":[138],"trees.":[141],"Then":[142],"based":[143],"this":[145],"result,":[146],"get":[148],"$K_{a,b}$":[152],"k":[156],"\\leq":[157],"a+b$.":[158],"Namely,":[159],"if":[160,168,177],"$k>b-a+2$":[161,169],"$a-b+k$":[163,171],"odd":[165],"then":[166,174,180],"$\u03ba_{k}(K_{a,b})=\\frac{a+b-k+1}{2}+\\lfloor\\frac{(a-b+k-1)(b-a+k-1)}{4(k-1)}\\rfloor,$":[167],"even":[173],"$\u03ba_{k}(K_{a,b})=\\frac{a+b-k}{2}+\\lfloor\\frac{(a-b+k)(b-a+k)}{4(k-1)}\\rfloor,$":[175],"$k\\leq":[178],"b-a+2$":[179],"$\u03ba_{k}(K_{a,b})=a.":[181],"$":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2019-07-30T00:00:00"}