{"title":"Projective Dimension of Some Graphs","authors":"Reji Thankachan, Ruby Rosemary, Sneha Balakrishnan","doi":"10.37193/cmi.2023.01.09","DOIUrl":null,"url":null,"abstract":"In this paper exact values for the projective dimension of edge ideals associated to some star related graphs and product graphs $G\\ \\square\\ P_2$, when $G=\\ C_n,\\ K_n$ and upper bounds for the projective dimension when $G=\\ P_n,\\ W_n$, are obtained. We have proved that $pd(C_{n+1}\\ \\square\\ P_2)= 2\\big(n-\\left\\lfloor \\frac{n}{4}\\right\\rfloor\\big)$, $pd(K_n\\ \\square\\ P_2)= 2n-2$ and $pd(P_{n+1}\\ \\square \\ P_2)\\le n+3+\\left\\lfloor \\frac{n-3}{2}\\right\\rfloor$, $pd(W_n\\ \\square\\ P_2)\\leq n+1+\\lceil\\frac{2n-1}{3}\\rceil$. These values are functions of the number of vertices in the corresponding graphs.","PeriodicalId":112946,"journal":{"name":"Creative Mathematics and Informatics","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Creative Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37193/cmi.2023.01.09","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper exact values for the projective dimension of edge ideals associated to some star related graphs and product graphs $G\ \square\ P_2$, when $G=\ C_n,\ K_n$ and upper bounds for the projective dimension when $G=\ P_n,\ W_n$, are obtained. We have proved that $pd(C_{n+1}\ \square\ P_2)= 2\big(n-\left\lfloor \frac{n}{4}\right\rfloor\big)$, $pd(K_n\ \square\ P_2)= 2n-2$ and $pd(P_{n+1}\ \square \ P_2)\le n+3+\left\lfloor \frac{n-3}{2}\right\rfloor$, $pd(W_n\ \square\ P_2)\leq n+1+\lceil\frac{2n-1}{3}\rceil$. These values are functions of the number of vertices in the corresponding graphs.