确定三次图若干族的数目

Q4 Mathematics

Journal of Algebra and Related Topics Pub Date : 2020-12-01 DOI:10.22124/JART.2020.16856.1209

A. Das, M. Saha

{"title":"确定三次图若干族的数目","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":"{\"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}","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

摘要

图$G = (V,E)$的决定数是集合$Ssubseteq V$的最小基数，使得$S$的点稳定器在$Aut(G)$的作用下是平凡的。本文计算了一些三次图族的确定数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Determining Number of Some Families of Cubic Graphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Algebra and Related Topics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

16 weeks