The generalized total graph of a commutative semiring

2017 ◽  
Vol 66 (2) ◽  
pp. 579-589
Author(s):  
Yahya Talebi ◽  
Atefeh Darzi
2014 ◽  
Vol 51 (3) ◽  
pp. 593-607 ◽  
Author(s):  
Shahabaddin Ebrahimi Atani ◽  
Saboura Dolati Pish Hesari ◽  
Mehdi Khoramdel

2013 ◽  
Vol 21 (2) ◽  
pp. 21-33 ◽  
Author(s):  
Shahabaddin Ebrahimi Atani ◽  
Fatemeh Esmaeili Khalil Saraei

Abstract We introduce and investigate the total graph of a commutative semiring with non-zero identity. The main purpose of this paper is to extend the definition and some results given in [2] to a more general semiring case.


Author(s):  
Zareen Tasneem ◽  
Farissa Tafannum ◽  
Maksuda Rahman Anti ◽  
Wali Mohammad Abdullah ◽  
Md. Mahbubur Rahman

2016 ◽  
Vol 16 (07) ◽  
pp. 1750130 ◽  
Author(s):  
Song-Chol Han

For a semimodule over any semiring, the maximal and prime [Formula: see text]-subsemimodules are characterized with the help of the quotient structure. The main results are as follows. A semimodule is [Formula: see text]-congruence-simple iff it is [Formula: see text]-subsemimodule-simple. A nonzero semimodule is [Formula: see text]-simple iff it satisfies condition [Formula: see text]. A proper [Formula: see text]-subsemimodule of a semimodule is a maximal [Formula: see text]-subsemimodule iff the quotient semimodule is [Formula: see text]-simple. A proper [Formula: see text]-subsemimodule is prime in a semimodule iff the quotient semimodule is prime. A nonzero [Formula: see text]-simple semimodule over a commutative semiring is prime. Lemma 6.2 in this paper corrects the statement and proof of Lemma 3.16 in [Yeşilot Hacet. J. Math. Stat. 39 (2010) 305–312].


2013 ◽  
Vol 12 (04) ◽  
pp. 1250199 ◽  
Author(s):  
T. ASIR ◽  
T. TAMIZH CHELVAM

The intersection graph ITΓ(R) of gamma sets in the total graph TΓ(R) of a commutative ring R, is the undirected graph with vertex set as the collection of all γ-sets in the total graph of R and two distinct vertices u and v are adjacent if and only if u ∩ v ≠ ∅. Tamizh Chelvam and Asir [The intersection graph of gamma sets in the total graph I, to appear in J. Algebra Appl.] studied about ITΓ(R) where R is a commutative Artin ring. In this paper, we continue our interest on ITΓ(R) and actually we study about Eulerian, Hamiltonian and pancyclic nature of ITΓ(R). Further, we focus on certain graph theoretic parameters of ITΓ(R) like the independence number, the clique number and the connectivity of ITΓ(R). Also, we obtain both vertex and edge chromatic numbers of ITΓ(R). In fact, it is proved that if R is a finite commutative ring, then χ(ITΓ(R)) = ω(ITΓ(R)). Having proved that ITΓ(R) is weakly perfect for all finite commutative rings, we further characterize all finite commutative rings for which ITΓ(R) is perfect. In this sequel, we characterize all commutative Artin rings for which ITΓ(R) is of class one (i.e. χ′(ITΓ(R)) = Δ(ITΓ(R))). Finally, it is proved that the vertex connectivity and edge connectivity of ITΓ(R) are equal to the degree of any vertex in ITΓ(R).


Author(s):  
M. Ebrahimpour

Let [Formula: see text] be a commutative semiring with nonzero identity and [Formula: see text] an [Formula: see text]-semimodule. In this paper, we introduce the concept of [Formula: see text]-primal subsemimodule of [Formula: see text] that is a generalization of primal ideal of a commutative ring. Then we give some examples and properties of these subsemimodules. Also, some characterizations of [Formula: see text]-primal subsemimodules are presented.


2018 ◽  
Vol 5 (2) ◽  
pp. 11-15
Author(s):  
Aaresh R.R ◽  
Venkatachalam M ◽  
Deepa T

Dynamic coloring of a graph G is a proper coloring. The chromatic number of a graph G is the minimum k such that G has a dynamic coloring with k colors. In this paper we investigate the dynamic chromatic number for the Central graph, Middle graph, Total graph and Line graph of Web graph Wn denoted by C(Wn), M(Wn), T(Wn) and L(Wn) respectively.


2021 ◽  
Vol 27 (2) ◽  
pp. 191-200
Author(s):  
K. Kalaiselvi ◽  
◽  
N. Mohanapriya ◽  
J. Vernold Vivin ◽  
◽  
...  

An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least k such that G has a coloring. In this paper we obtain the r-dynamic chromatic number of the central graph, middle graph, total graph, line graph, para-line graph and sub-division graph of the comb graph $P_n\odot K_1$ denoted by $C(P_n\odot K_1), M(P_n\odot K_1), T(P_n\odot K_1), L(P_n\odot K_1), P(P_n\odot K_1)$ and $S(P_n\odot K_1)$ respectively by finding the upper bound and lower bound for the r-dynamic chromatic number of the Comb graph.


Sign in / Sign up

Export Citation Format

Share Document