{"title":"关于广义Sierpinski图的迫零数","authors":"E. Vatandoost, F. Ramezani, S. Alikhani","doi":"10.22108/TOC.2018.101107.1463","DOIUrl":null,"url":null,"abstract":"In this article we study the Zero forcing number of Generalized Sierpi'{n}ski graphs $S(G,t)$. More precisely, we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight. In particular, we consider the cases in which the base graph $G$ is a star, path, a cycle or a complete graph.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"8 1","pages":"41-50"},"PeriodicalIF":0.6000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the zero forcing number of generalized Sierpinski graphs\",\"authors\":\"E. Vatandoost, F. Ramezani, S. Alikhani\",\"doi\":\"10.22108/TOC.2018.101107.1463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article we study the Zero forcing number of Generalized Sierpi'{n}ski graphs $S(G,t)$. More precisely, we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight. In particular, we consider the cases in which the base graph $G$ is a star, path, a cycle or a complete graph.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"8 1\",\"pages\":\"41-50\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2018.101107.1463\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2018.101107.1463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
On the zero forcing number of generalized Sierpinski graphs
In this article we study the Zero forcing number of Generalized Sierpi'{n}ski graphs $S(G,t)$. More precisely, we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight. In particular, we consider the cases in which the base graph $G$ is a star, path, a cycle or a complete graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
