University of KashanMathematics Interdisciplinary Research2538-36393120180601Generation of High Efficient Quasi-Single-Cycle 3 and 6THZ Pulses using Multilayer Structures OH1/SiO2 and DSTMS/SiO2 1134668010.22052/mir.2017.58878.1040ENHamid RezaZangenehDepartment of Photonics, Faculty of Physics, University of Kashan, Kashan, I. R. Iran0000-0002-2385-3159MaryamKashaniDepartment of Photonics, Faculty of Physics, University of Kashan, Kashan, I. R. IranJournal Article20160803We propose that high efficient terahertz (THz) multilayer structures are composed of DSTMS/SiO2 and OH1/SiO2 at 3 and 6THz frequencies. We show that the efficiencies of these structures are higher than DAST/SiO2 structure in both of 3 and 6THz frequencies. OH1/SiO2 structure at 6THz has an efficiency as large as 10-1; at 3THz frequency, DSTMS/SiO2 structure has an efficiency as large as 10-2. Meanwhile bulk OH1 has an efficiency as large as 10-3 at 3THz due to perfect phase matching whose efficiency is lower than DSTMS/SiO2 structure. We also show that other structures, namely DSTMS/ZnTe at 3THz and DAST/GaP at 8THz, have low efficiency, so they are not suitable as THz sources.University of KashanMathematics Interdisciplinary Research2538-36393120180601Fixed Point Theorems for kg- Contractive Mappings in a Complete Strong Fuzzy Metric Space15295528110.22052/mir.2017.93427.1070ENKandala KanakamahalakshmiSarmaCollage of Science and Technology,
Andhra University, Department of Mathematics, Visakhapatnam-530 003, IndiaYohannesAemroCollage of Natural and Computational,
Department of Mathematics,
P. O. Box 07,
Wolkite University, Wolkite, EthiopiaJournal Article20170724In this paper, we introduce a new class of contractive mappings in a fuzzy metric space and we present fixed point results for this class of maps.University of KashanMathematics Interdisciplinary Research2538-36393120180601On Powers of Some Graph Operations31435710110.22052/mir.2018.85618.1062ENMohamedSeoudDepartment of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, EgyptHamdyMohamed HafezDepartment of Basic science, Faculty of Computers and Information, Fayoum University, Fayoum 63514, EgyptJournal Article20170511Let G*H be the product * of G and H. In this paper we determine the rth power of the graph G*H in terms of G<sup>r</sup>, H<sup>r</sup>and G<sup>r</sup>*H<sup>r</sup>, when * is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation (G*H)<sup>r</sup>=G<sup>r</sup>*H<sup>r</sup>. We also compute the Wiener index and Wiener polarity index of the skew product.University of KashanMathematics Interdisciplinary Research2538-36393120180601Average Degree-Eccentricity Energy of Graphs45545815110.22052/mir.2018.119231.1090ENIvanGutmanUniversity Kragujevac, SerbiaVeenaMathadDepartment of Mathematics
University of Mysore
Mysuru, IndiaShadi IbrahimKhalafDepartment of Studies in Mathematics, Faculty of Science and Technology Manasagangotri, University of Mysore, Mysore, India.Sultan SenanMahdeDepartment of Mathematics
University of Mysore
Mysuru, IndiaJournal Article20180213The concept of average degree-eccentricity matrix ADE(G) of a connected graph G is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.University of KashanMathematics Interdisciplinary Research2538-36393120180601Some Applications of Strong Product55656336010.22052/mir.2018.55115.1033ENMostafaTavakoliDepartment of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. IranFreydoonRahbarniaDepartment of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. IranIrandokhtRezaee Abdolhosein ZadehDepartment of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. IranJournal Article20160601Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u<sub>1</sub>, v<sub>1</sub>) is adjacent with v= (u<sub>2</sub>, v<sub>2</sub>) whenever (v<sub>1</sub> = v<sub>2</sub> and u1 is adjacent with u<sub>2</sub>) or (u<sub>1</sub> = u<sub>2 </sub>and v<sub>1</sub> is adjacent with v<sub>2</sub>) or (u1 is adjacent with u<sub>2</sub> and v<sub>1</sub> is adjacent with v<sub>2</sub>). In this paper, we ﬁrst collect the earlier results about strong product and then we present applications of these results in working with some important graphs<br />such as Fence graphs.University of KashanMathematics Interdisciplinary Research2538-36393120180601On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges67746351110.22052/mir.2018.115910.1087ENAbbasSeifyDepartment of Sciences,
Shahid Rajaei Teacher Training University,
Tehran, I. R. IranJournal Article20180118A tree containing exactly two non-pendant vertices is called a double-star. Let k<sub>1</sub> and k<sub>2</sub> be two positive integers. The double-star with degree sequence (k<sub>1</sub>+1, k<sub>2</sub>+1, 1, ..., 1) is denoted by S<sub>k1</sub>, <sub>k2</sub>. It is known that a cubic graph has an S<sub>1,1</sub>-decomposition if and only if it contains a perfect matching. In this paper, we study the S<sub>1,2</sub>-decomposition of cubic graphs. We present some necessary and some sufficient conditions for the existence of an S<sub>1,2</sub>-decomposition in cubic graphs.