{"title":"A spectral condition for component factors in graphs","authors":"Sufang Wang, Wei Zhang","doi":"10.1051/ro/2024126","DOIUrl":null,"url":null,"abstract":"Let $G$ be a graph. A $\\{K_{1,2},K_{1,3},K_5\\}$-factor of $G$ is a spanning subgraph of $G$, in which every component is isomorphic to a member of $\\{K_{1,2},K_{1,3},K_5\\}$. In this paper, we establish a lower bound on the spectral radius of $G$ to ensure that $G$ contains a $\\{K_{1,2},K_{1,3},K_5\\}$-factor.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"42 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO - Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2024126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Let $G$ be a graph. A $\{K_{1,2},K_{1,3},K_5\}$-factor of $G$ is a spanning subgraph of $G$, in which every component is isomorphic to a member of $\{K_{1,2},K_{1,3},K_5\}$. In this paper, we establish a lower bound on the spectral radius of $G$ to ensure that $G$ contains a $\{K_{1,2},K_{1,3},K_5\}$-factor.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
