http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Doost, Mostafa Emami (검색결과 5 건)
- 무료
- 기관 내 무료
- 유료
-
A correction to a paper on Roman κ-domination in graphs
Doost Ali Mojdeh,Seyed Mehdi Hosseini Moghaddam 대한수학회 2013 대한수학회보 Vol.50 No.2
Let G = (V,E) be a graph and k be a positive integer. A k- dominating set of G is a subset S ⊆ V such that each vertex in V\S has at least k neighbors in S. A Roman k-dominating function on G is a function f : V ! {0, 1, 2} such that every vertex v with f(v) = 0 is adjacent to at least k vertices v1, v2, . . . , vk with f(vi) = 2 for i = 1, 2, . . . , k. In the paper titled “Roman k-domination in graphs” (J. Korean Math. Soc. 46 (2009), no. 6, 1309–1318) K. Kammerling and L. Volkmann showed that for any graph G with n vertices, kR(G) + kR(G) min {2n, 4k + 1}, and the equality holds if and only if n 2k or k 2 and n = 2k + 1 or k = 1 and G or G has a vertex of degree n − 1 and its complement has a vertex of degree n − 2. In this paper we find a counterexample of Kammerling and Volkmann’s result and then give a correction to the result.
-
A CORRECTION TO A PAPER ON ROMAN κ-DOMINATION IN GRAPHS
Mojdeh, Doost Ali,Moghaddam, Seyed Mehdi Hosseini Korean Mathematical Society 2013 대한수학회보 Vol.50 No.2
Let G = (V, E) be a graph and k be a positive integer. A $k$-dominating set of G is a subset $S{\subseteq}V$ such that each vertex in $V{\backslash}S$ has at least $k$ neighbors in S. A Roman $k$-dominating function on G is a function $f$ : V ${\rightarrow}$ {0, 1, 2} such that every vertex ${\upsilon}$ with $f({\upsilon})$ = 0 is adjacent to at least $k$ vertices ${\upsilon}_1$, ${\upsilon}_2$, ${\ldots}$, ${\upsilon}_k$ with $f({\upsilon}_i)$ = 2 for $i$ = 1, 2, ${\ldots}$, $k$. In the paper titled "Roman $k$-domination in graphs" (J. Korean Math. Soc. 46 (2009), no. 6, 1309-1318) K. Kammerling and L. Volkmann showed that for any graph G with $n$ vertices, ${{\gamma}_{kR}}(G)+{{\gamma}_{kR}(\bar{G})}{\geq}$ min $\{2n,4k+1\}$, and the equality holds if and only if $n{\leq}2k$ or $k{\geq}2$ and $n=2k+1$ or $k=1$ and G or $\bar{G}$ has a vertex of degree $n$ - 1 and its complement has a vertex of degree $n$ - 2. In this paper we find a counterexample of Kammerling and Volkmann's result and then give a correction to the result.
-
Lower and upper bound on defining spectrum of regular graphs
Eric Mendelsohn,Doost Ali Mojdeh 장전수학회 2011 Advanced Studies in Contemporary Mathematics Vol.21 No.1
The defining number d_c(G) of a graph G = (V,E) properly colored with c ≥Χ(G) colors, is the least number of vertices of G to which colors must be assigned in order that this assignment be uniquely extendable to a vertex coloring of G. Let F be a family of k-regular graphs on n vertices and let any graph G in F be properly coloring with c ≥Χ(G) colors. A de¯ning spectrum of F with c colors is Spec_c(F) = [수식]. The sharp lower and upper bound of Spec_c(F) of k-regular graphs, k∈{2, 3} and (Χ(G)≤c≤ k+1)are obtained. For any k, it is obtained a sharp lower bound for Spec_k(F') where F' is a family of connected k-regular graphs.
-
Antenna Selection and Power Allocation for Energy Efficient MIMO Systems
Mahdi Eskandari,Ali Mohamad Doost-Hoseini,정재훈,이인규 한국통신학회 2018 Journal of communications and networks Vol.20 No.6
In this paper, we investigate a new solution for theenergy efficiency (EE) maximization and power allocation problemin point-to-point multiple-input multiple-output (MIMO) spatialmultiplexing schemes. Different from conventional energyefficientoptimization approaches that require iterative numericalalgorithms, we derive an optimal solution in a closed form, whichprovides an insight upon the relation between the optimum EE andsystem parameters such as circuit power and channel conditions. In addition, using the proposed closed form function, we present anupper bound on the optimum EE in terms of the full active transmitantennas parameters. Based on the derived upper bound, we alsopropose a new antenna selection algorithm which achieves almostthe same performance as the optimum solution with much reducedcomplexity.
-
Razavi, Sayed Mohammad,Zolfaghari, Behzad,Doost, Mostafa Emami,Tahani, Bahareh Asian Pacific Journal of Cancer Prevention 2015 Asian Pacific journal of cancer prevention Vol.16 No.1
Background: Oral health professionals are responsible in Iran for providing a brief tobacco cessation program to smoker patients. The aim of this study was to assess Iranian dental student and dentist practice, knowledge and attitudes toward smoking cessation programs. Materials and Methods: A valid and reliable self-administered questionnaire was designed and distributed to 150 dentists working in Isfahan-Iran and 60 dental students. Some questions were developed based on the expected 5A tobacco cessation protocol. Statements on attitudes focused on professional responsibility towards smoking cessation and its effectiveness. Chi-square, ANOVA, and t test were used for statistical analysis. Results: The cessation program in dental settings covers a small group of patients (18%). Some 69.1% (n=96) of dentists reported asking their patients about tobacco use, 64% (n=83) advising their patients to quit, 33.8% (n=47) assessing their patients willingness to quit and 20% (n=28) reported helping their patients in changing their behavior. A far lower percentage reported active involvement in arranging assistance for smokers to quit (4.3%, n=5). Some 22% of students and 26% of dentists disagreed that the tobacco cessation programs should be as part of dentists' professional responsibility and 70% of them were willing to follow the protocol of tobacco cessation for patients. Conclusions: Iranian dentist performance regarding tobacco cessation is weak. Dentists and students indicated their lack of knowledge as the major reason for non-adherence to the protocol. Therefore, planning to encourage dentist to follow the protocol needs continuous educational programs.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
