A. Cabrera Martínez, Suitberto Cabrera García, Iztok Peterin, Ismael G. Yero
{"title":"一些图运算的共独立支配总数","authors":"A. Cabrera Martínez, Suitberto Cabrera García, Iztok Peterin, Ismael G. Yero","doi":"10.33044/revuma.1652","DOIUrl":null,"url":null,"abstract":". A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex of D . The total domi- nating set D is called a total co-independent dominating set if the subgraph induced by V ( G ) − D is edgeless. The minimum cardinality among all total co-independent dominating sets of G is the total co-independent domination number of G . In this article we study the total co-independent domination number of the join, strong, lexicographic, direct and rooted products of graphs.","PeriodicalId":54469,"journal":{"name":"Revista De La Union Matematica Argentina","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The total co-independent domination number of some graph operations\",\"authors\":\"A. Cabrera Martínez, Suitberto Cabrera García, Iztok Peterin, Ismael G. Yero\",\"doi\":\"10.33044/revuma.1652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex of D . The total domi- nating set D is called a total co-independent dominating set if the subgraph induced by V ( G ) − D is edgeless. The minimum cardinality among all total co-independent dominating sets of G is the total co-independent domination number of G . In this article we study the total co-independent domination number of the join, strong, lexicographic, direct and rooted products of graphs.\",\"PeriodicalId\":54469,\"journal\":{\"name\":\"Revista De La Union Matematica Argentina\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista De La Union Matematica Argentina\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.33044/revuma.1652\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista De La Union Matematica Argentina","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.33044/revuma.1652","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
The total co-independent domination number of some graph operations
. A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex of D . The total domi- nating set D is called a total co-independent dominating set if the subgraph induced by V ( G ) − D is edgeless. The minimum cardinality among all total co-independent dominating sets of G is the total co-independent domination number of G . In this article we study the total co-independent domination number of the join, strong, lexicographic, direct and rooted products of graphs.
期刊介绍:
Revista de la Unión Matemática Argentina is an open access journal, free of charge for both authors and readers. We publish original research articles in all areas of pure and applied mathematics.