{"title":"网格图中路径支配数的进一步研究","authors":"Leomarich F. Casinillo","doi":"10.14710/jfma.v6i1.16608","DOIUrl":null,"url":null,"abstract":"This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed.","PeriodicalId":359074,"journal":{"name":"Journal of Fundamental Mathematics and Applications (JFMA)","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A CLOSER LOOK AT A PATH DOMINATION NUMBER IN GRID GRAPHS\",\"authors\":\"Leomarich F. Casinillo\",\"doi\":\"10.14710/jfma.v6i1.16608\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed.\",\"PeriodicalId\":359074,\"journal\":{\"name\":\"Journal of Fundamental Mathematics and Applications (JFMA)\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Fundamental Mathematics and Applications (JFMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14710/jfma.v6i1.16608\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Fundamental Mathematics and Applications (JFMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14710/jfma.v6i1.16608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A CLOSER LOOK AT A PATH DOMINATION NUMBER IN GRID GRAPHS
This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
