Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Associate ring"'
Publikováno v:
Mathematics, Vol 10, Iss 12, p 2014 (2022)
For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates. The graph AG(R) contains components equal in numb
Externí odkaz:
https://doaj.org/article/583adfd3924c4408a326652caf3fbe3c
Publikováno v:
TWMS Journal of Applied and Engineering Mathematics, Vol 7, Iss 1, Pp 173-179 (2017)
Volume: 7, Issue: 1 173-179
TWMS Journal of Applied and Engineering Mathematics
Volume: 7, Issue: 1 173-179
TWMS Journal of Applied and Engineering Mathematics
The line graph and 1-quasitotal graph are well-known concepts in graph theory. In Satyanarayana, Srinivasulu, and Syam Prasad [13], it is proved that if a graph G consists of exactly m connected components Gi 1 ≤ i ≤ m then L G = L G1 and L G1 is
The line graph and 1-quasitotal graph are well-known concepts in graph theory. In Satyanarayana, Srinivasulu, and Syam Prasad [13], it is proved that if a graph G consists of exactly m connected components Gi (1 ≤ i ≤ m) then L(G) = L(G1) = L(G2)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3401::1807b8080f53b52b485a198ec0408e88
http://jaem.isikun.edu.tr/web/index.php/archive/93-vol7no1/290
http://jaem.isikun.edu.tr/web/index.php/archive/93-vol7no1/290
Autor:
MANAL GHANEM
Publikováno v:
Volume: 35, Issue: 2 333-340
Turkish Journal of Mathematics
Turkish Journal of Mathematics
In this paper we study some properties of associate and presimplifiable rings. We give a characterization of the associate (resp., domainlike) pullback P of R1 \rightarrow{R3} \leftarrow{R2}, where R1 and R2 are two presimplifiable (resp., domainlike
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f90712e1baa62e0177625aa354bfc680
https://dergipark.org.tr/tr/pub/tbtkmath/issue/12220/145876
https://dergipark.org.tr/tr/pub/tbtkmath/issue/12220/145876
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.