{"title":"自由半模的约简非零分量图的补","authors":"T. Tamizh Chelvam, K. Prabha Ananthi","doi":"10.1007/s11766-023-3737-5","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(\\mathbb{M}\\)</span> be a finitely generated free semimodule over a semiring <span>\\(\\mathbb{S}\\)</span> with identity having invariant basis number property with a basis <i>α</i> = {<i>α</i><sub>1</sub>,…, <i>α</i><sub><i>k</i></sub>}. The complement <span>\\(\\overline {{\\Gamma ^ * }} \\left(\\mathbb{M}\\right)\\)</span> of the reduced non-zero component graph <span>\\({\\Gamma ^ * }\\left(\\mathbb{M}\\right)\\)</span> of <span>\\(\\mathbb{M}\\)</span>, is the simple undirected graph with <span>\\(V = {\\mathbb{M}^ * }\\backslash \\left\\{ {\\sum\\limits_{i = 1}^k {{c_i}} {\\alpha _i}:{c_i} \\ne 0\\,\\,\\forall \\,\\,i} \\right\\}\\)</span> as the vertex set and such that there is an edge between two distinct vertices <span>\\(a = \\sum\\limits_{i = 1}^k {{a_i}{\\alpha _i}} \\)</span> and <span>\\(b = \\sum\\limits_{i = 1}^k {{b_i}{\\alpha _i}} \\)</span> if and only if there exists no i such that both <i>a</i><sub><i>i</i></sub>, <i>b</i><sub><i>i</i></sub> are non-zero. In this paper, we show that the graph <span>\\(\\overline {{\\Gamma ^ * }} \\left(\\mathbb{M}\\right)\\)</span> is connected and find its domination number, clique number and chromatic number. In the case of finite semirings, we determine the degree of each vertex, order, size, vertex connectivity and girth of <span>\\(\\overline {{\\Gamma ^ * }} \\left(\\mathbb{M}\\right)\\)</span>. Also, we give a necessary and sufficient condition for <span>\\(\\overline {{\\Gamma ^ * }} \\left(\\mathbb{M}\\right)\\)</span> to be Eulerian or Hamiltonian or planar.</p></div>","PeriodicalId":55568,"journal":{"name":"Applied Mathematics-A Journal of Chinese Universities Series B","volume":"38 1","pages":"1 - 15"},"PeriodicalIF":1.0000,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complement of the reduced non-zero component graph of free semimodules\",\"authors\":\"T. Tamizh Chelvam, K. Prabha Ananthi\",\"doi\":\"10.1007/s11766-023-3737-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <span>\\\\(\\\\mathbb{M}\\\\)</span> be a finitely generated free semimodule over a semiring <span>\\\\(\\\\mathbb{S}\\\\)</span> with identity having invariant basis number property with a basis <i>α</i> = {<i>α</i><sub>1</sub>,…, <i>α</i><sub><i>k</i></sub>}. The complement <span>\\\\(\\\\overline {{\\\\Gamma ^ * }} \\\\left(\\\\mathbb{M}\\\\right)\\\\)</span> of the reduced non-zero component graph <span>\\\\({\\\\Gamma ^ * }\\\\left(\\\\mathbb{M}\\\\right)\\\\)</span> of <span>\\\\(\\\\mathbb{M}\\\\)</span>, is the simple undirected graph with <span>\\\\(V = {\\\\mathbb{M}^ * }\\\\backslash \\\\left\\\\{ {\\\\sum\\\\limits_{i = 1}^k {{c_i}} {\\\\alpha _i}:{c_i} \\\\ne 0\\\\,\\\\,\\\\forall \\\\,\\\\,i} \\\\right\\\\}\\\\)</span> as the vertex set and such that there is an edge between two distinct vertices <span>\\\\(a = \\\\sum\\\\limits_{i = 1}^k {{a_i}{\\\\alpha _i}} \\\\)</span> and <span>\\\\(b = \\\\sum\\\\limits_{i = 1}^k {{b_i}{\\\\alpha _i}} \\\\)</span> if and only if there exists no i such that both <i>a</i><sub><i>i</i></sub>, <i>b</i><sub><i>i</i></sub> are non-zero. In this paper, we show that the graph <span>\\\\(\\\\overline {{\\\\Gamma ^ * }} \\\\left(\\\\mathbb{M}\\\\right)\\\\)</span> is connected and find its domination number, clique number and chromatic number. In the case of finite semirings, we determine the degree of each vertex, order, size, vertex connectivity and girth of <span>\\\\(\\\\overline {{\\\\Gamma ^ * }} \\\\left(\\\\mathbb{M}\\\\right)\\\\)</span>. Also, we give a necessary and sufficient condition for <span>\\\\(\\\\overline {{\\\\Gamma ^ * }} \\\\left(\\\\mathbb{M}\\\\right)\\\\)</span> to be Eulerian or Hamiltonian or planar.</p></div>\",\"PeriodicalId\":55568,\"journal\":{\"name\":\"Applied Mathematics-A Journal of Chinese Universities Series B\",\"volume\":\"38 1\",\"pages\":\"1 - 15\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Mathematics-A Journal of Chinese Universities Series B\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11766-023-3737-5\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics-A Journal of Chinese Universities Series B","FirstCategoryId":"1089","ListUrlMain":"https://link.springer.com/article/10.1007/s11766-023-3737-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complement of the reduced non-zero component graph of free semimodules
Let \(\mathbb{M}\) be a finitely generated free semimodule over a semiring \(\mathbb{S}\) with identity having invariant basis number property with a basis α = {α1,…, αk}. The complement \(\overline {{\Gamma ^ * }} \left(\mathbb{M}\right)\) of the reduced non-zero component graph \({\Gamma ^ * }\left(\mathbb{M}\right)\) of \(\mathbb{M}\), is the simple undirected graph with \(V = {\mathbb{M}^ * }\backslash \left\{ {\sum\limits_{i = 1}^k {{c_i}} {\alpha _i}:{c_i} \ne 0\,\,\forall \,\,i} \right\}\) as the vertex set and such that there is an edge between two distinct vertices \(a = \sum\limits_{i = 1}^k {{a_i}{\alpha _i}} \) and \(b = \sum\limits_{i = 1}^k {{b_i}{\alpha _i}} \) if and only if there exists no i such that both ai, bi are non-zero. In this paper, we show that the graph \(\overline {{\Gamma ^ * }} \left(\mathbb{M}\right)\) is connected and find its domination number, clique number and chromatic number. In the case of finite semirings, we determine the degree of each vertex, order, size, vertex connectivity and girth of \(\overline {{\Gamma ^ * }} \left(\mathbb{M}\right)\). Also, we give a necessary and sufficient condition for \(\overline {{\Gamma ^ * }} \left(\mathbb{M}\right)\) to be Eulerian or Hamiltonian or planar.
期刊介绍:
Applied Mathematics promotes the integration of mathematics with other scientific disciplines, expanding its fields of study and promoting the development of relevant interdisciplinary subjects.
The journal mainly publishes original research papers that apply mathematical concepts, theories and methods to other subjects such as physics, chemistry, biology, information science, energy, environmental science, economics, and finance. In addition, it also reports the latest developments and trends in which mathematics interacts with other disciplines. Readers include professors and students, professionals in applied mathematics, and engineers at research institutes and in industry.
Applied Mathematics - A Journal of Chinese Universities has been an English-language quarterly since 1993. The English edition, abbreviated as Series B, has different contents than this Chinese edition, Series A.