{"title":"星状因子和路径因子的韧性和结合数界限","authors":"Xin Feng, Xingchao Deng","doi":"10.1051/ro/2023057","DOIUrl":null,"url":null,"abstract":"Let $\\mathcal{L}$ be a set which consists of some connected graphs. Let $E$ be a spanning subgraph of graph $G$. It is called a $\\mathcal{L}$-factor if every component of it is isomorphic to the element in $\\mathcal{L}$. In this contribution, we give the lower bounds of four parameters ($t(G),$ $I(G), $ $I'(G),$ $\\operatorname{bind}(G)$) of $G$, which force the graph $G$ admits a $(\\{K_{1,i}:q\\leq i\\leq 2q-1\\}\\cup \\{K_{2q+1}\\})$-factor for $q\\geq 2$ and a $\\{P_2, P_{2q+1}\\}$-factor for $q\\geq 3$ respectively. The tightness of the bounds are given.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Toughness and binding number bounds of star-like and path factor\",\"authors\":\"Xin Feng, Xingchao Deng\",\"doi\":\"10.1051/ro/2023057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $\\\\mathcal{L}$ be a set which consists of some connected graphs. Let $E$ be a spanning subgraph of graph $G$. It is called a $\\\\mathcal{L}$-factor if every component of it is isomorphic to the element in $\\\\mathcal{L}$. In this contribution, we give the lower bounds of four parameters ($t(G),$ $I(G), $ $I'(G),$ $\\\\operatorname{bind}(G)$) of $G$, which force the graph $G$ admits a $(\\\\{K_{1,i}:q\\\\leq i\\\\leq 2q-1\\\\}\\\\cup \\\\{K_{2q+1}\\\\})$-factor for $q\\\\geq 2$ and a $\\\\{P_2, P_{2q+1}\\\\}$-factor for $q\\\\geq 3$ respectively. The tightness of the bounds are given.\",\"PeriodicalId\":20872,\"journal\":{\"name\":\"RAIRO Oper. Res.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Toughness and binding number bounds of star-like and path factor
Let $\mathcal{L}$ be a set which consists of some connected graphs. Let $E$ be a spanning subgraph of graph $G$. It is called a $\mathcal{L}$-factor if every component of it is isomorphic to the element in $\mathcal{L}$. In this contribution, we give the lower bounds of four parameters ($t(G),$ $I(G), $ $I'(G),$ $\operatorname{bind}(G)$) of $G$, which force the graph $G$ admits a $(\{K_{1,i}:q\leq i\leq 2q-1\}\cup \{K_{2q+1}\})$-factor for $q\geq 2$ and a $\{P_2, P_{2q+1}\}$-factor for $q\geq 3$ respectively. The tightness of the bounds are given.