http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Somayeh Moradi (검색결과 5 건)
- 무료
- 기관 내 무료
- 유료
-
Somayeh Harimi,Azam Marjani,Sadegh Moradi 대한기계학회 2016 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.30 No.9
Numerical study of forced convection heat transfer and fluid flow in laminar flow regime for a circular cylinder attached by three control rods is performed using the overset grid method. The aim of this work is evaluation of the control rods performance placed in equilateral triangular arrangements in suppressing vortex induced vibration of a primary cylinder. The influence of the dimensionless parameters including attach angle α, spacing ratio G/D, and Reynolds number on the hydrodynamic forces of the primary cylinder is also investigated. The unsteady flow at Reynolds number of 200 and prandtl numbers of 0.7 and 7.0 is considered. In order to discretize the governing equations, a finite volume code based on the SIMPLEC algorithm is employed. Moreover, the local and mean Nusselt numbers are presented to illustrate the heat transfer characteristics of the primary cylinder and surrounding rods.
-
Total domination number of central graphs
Farshad Kazemnejad,Somayeh Moradi 대한수학회 2019 대한수학회보 Vol.56 No.4
Let $G$ be a graph with no isolated vertex. \emph{A total dominating set}, abbreviated TDS of $G$ is a subset $S$ of vertices of $G$ such that every vertex of $G$ is adjacent to a vertex in $S$. \emph{The total domination number} of $G$ is the minimum cardinality of a TDS of $G$. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph $C(G)$ in terms of some invariants of the graph $G$. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.
-
RESOLUTION OF UNMIXED BIPARTITE GRAPHS
Mohammadi, Fatemeh,Moradi, Somayeh Korean Mathematical Society 2015 대한수학회보 Vol.52 No.3
Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.
-
RESOLUTION OF UNMIXED BIPARTITE GRAPHS
Fatemeh Mohammadi,Somayeh Moradi 대한수학회 2015 대한수학회보 Vol.52 No.3
Let G be a graph on the vertex set V (G) = {x1, . . . , xn} with the edge set E(G), and let R = K[x1, . . . , xn] be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials xixj with {xi, xj} ∈ E(G), and the vertex cover ideal IG generated by monomials ∏xi∈C xi for all minimal vertex covers C of G. A minimal vertex cover of G is a subset C ⊂ V (G) such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers LG and we explicitly describe the minimal free resolution of the ideal associated to LG which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.
-
TOTAL DOMINATION NUMBER OF CENTRAL GRAPHS
Kazemnejad, Farshad,Moradi, Somayeh Korean Mathematical Society 2019 대한수학회보 Vol.56 No.4
Let G be a graph with no isolated vertex. A total dominating set, abbreviated TDS of G is a subset S of vertices of G such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a TDS of G. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph C(G) in terms of some invariants of the graph G. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
