{"title":"包含任意边的图因子的谱充分条件","authors":"Jin Cai, Bo Zhou","doi":"10.1051/ro/2024153","DOIUrl":null,"url":null,"abstract":"A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"35 10","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Spectral sufficient conditions for graph factors containing any edge\",\"authors\":\"Jin Cai, Bo Zhou\",\"doi\":\"10.1051/ro/2024153\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.\",\"PeriodicalId\":506995,\"journal\":{\"name\":\"RAIRO - Operations Research\",\"volume\":\"35 10\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-24\",\"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/2024153\",\"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 - Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2024153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spectral sufficient conditions for graph factors containing any edge
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
