{"title":"Determining Number of Some Families of Cubic Graphs","authors":"A. Das, M. Saha","doi":"10.22124/JART.2020.16856.1209","DOIUrl":null,"url":null,"abstract":"The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $Ssubseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we compute the determining number of some families of cubic graphs.","PeriodicalId":52302,"journal":{"name":"Journal of Algebra and Related Topics","volume":"8 1","pages":"39-55"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebra and Related Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22124/JART.2020.16856.1209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3
Abstract
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $Ssubseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we compute the determining number of some families of cubic graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
