{"title":"The inclusion subsemimodule graph of a semimodule","authors":"Ahmed H Alwan, Zahraa A. Nema","doi":"10.47974/jdmsc-1636","DOIUrl":null,"url":null,"abstract":"Let R be an abelian semiring with unity, U be an R-semimodule. The inclusion subsemimodule graph of U, indicated IS(U), is a graph with nodes that all non-trivial subsemimodules of U and two different nodes N and L are adjacent if and only if N ⊂ L or L ⊂ N. In this worke, proved that if U is subtractive semimodule then IS(U) is not connected if is a direct sum of two simple R-semimodules. Besides, it has been proved that IS(U) is a complete graph if and only if U is a uniserial semimodule. girth, diameter, chromatic and clique numbers of IS(U) have been studied. and only if U.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Discrete Mathematical Sciences and Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47974/jdmsc-1636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Let R be an abelian semiring with unity, U be an R-semimodule. The inclusion subsemimodule graph of U, indicated IS(U), is a graph with nodes that all non-trivial subsemimodules of U and two different nodes N and L are adjacent if and only if N ⊂ L or L ⊂ N. In this worke, proved that if U is subtractive semimodule then IS(U) is not connected if is a direct sum of two simple R-semimodules. Besides, it has been proved that IS(U) is a complete graph if and only if U is a uniserial semimodule. girth, diameter, chromatic and clique numbers of IS(U) have been studied. and only if U.