正则图的最小支配集的代数方法

IF 0.4 Q4 MATHEMATICS Electronic Journal of Graph Theory and Applications Pub Date : 2023-10-24 DOI:10.5614/ejgta.2023.11.2.5

Mehrdad Nasernejad

{"title":"正则图的最小支配集的代数方法","authors":"Mehrdad Nasernejad","doi":"10.5614/ejgta.2023.11.2.5","DOIUrl":null,"url":null,"abstract":"Suppose that V = {1, …, n } is a non-empty set of n elements, S = { S 1 , …, S m } a non-empty set of m non-empty subsets of V . In this paper, by using some algebraic notions in commutative algebra, we investigate the question arises whether there exists an undirected finite simple graph G with V ( G )= V , where S is the set whose elements are the minimal dominating sets of G .","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"7 3","pages":"0"},"PeriodicalIF":0.4000,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An algebraic approach to sets defining minimal dominating sets of regular graphs\",\"authors\":\"Mehrdad Nasernejad\",\"doi\":\"10.5614/ejgta.2023.11.2.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Suppose that V = {1, …, n } is a non-empty set of n elements, S = { S 1 , …, S m } a non-empty set of m non-empty subsets of V . In this paper, by using some algebraic notions in commutative algebra, we investigate the question arises whether there exists an undirected finite simple graph G with V ( G )= V , where S is the set whose elements are the minimal dominating sets of G .\",\"PeriodicalId\":43771,\"journal\":{\"name\":\"Electronic Journal of Graph Theory and Applications\",\"volume\":\"7 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Graph Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5614/ejgta.2023.11.2.5\",\"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":"Electronic Journal of Graph Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/ejgta.2023.11.2.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设V ={1，…，n}是包含n个元素的非空集合，S = {s1，…，m}是包含V的m个非空子集的非空集合。本文利用交换代数中的一些代数概念，研究了是否存在一个无向有限简单图G，且V (G)= V，其中S是其元素为G的最小支配集的集合。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An algebraic approach to sets defining minimal dominating sets of regular graphs

Suppose that V = {1, …, n } is a non-empty set of n elements, S = { S 1 , …, S m } a non-empty set of m non-empty subsets of V . In this paper, by using some algebraic notions in commutative algebra, we investigate the question arises whether there exists an undirected finite simple graph G with V ( G )= V , where S is the set whose elements are the minimal dominating sets of G .

求助全文

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

来源期刊

Electronic Journal of Graph Theory and Applications MATHEMATICS-

CiteScore

1.20

自引率

28.60%

发文量

审稿时长

52 weeks

期刊介绍： We publish research articles written in English in all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences.

期刊最新文献

An algebraic approach to sets defining minimal dominating sets of regular graphs Multiplicity-free gonality on graphs Linear codes and cyclic codes over finite rings and their generalizations: a survey On z-cycle factorizations with two associate classes where z is 2a and a is even The dominating partition dimension and locating-chromatic number of graphs