Abstract
Let M be a unitary left R-semimodule where R is a commutative semiring with identity. The small intersection graph G(M) of a semimodule M is an undirected simple graph with all non- small proper subsemimodules of M as vertices and two distinct vertices N and L are adjacent if and only if N ∩ L is not small in M. In this paper, we investigate the fundamental properties of these graphs to relate the combinatorial properties of G(M) to the algebraic properties of the R-semimodule M. Determine the diameter and the girth of G(M). Moreover, we study cut vertex, clique number, domination number and independence number of the graph G(M). It is shown that the independence number of small graph is equal to the number of its maximal subsemimodules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Nonlinear Analysis and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
