مرور بر اساس عنوان

در حال نمایش موارد 103121 - 103140 از 744131

  • The $ k $-${rm bf{ th}}$ spectral moment of signed complete graphs 

    Dalvandi, Soudabeh؛ Heydari, Farideh؛ Maghasedi, Mohammad (University of Guilan, 2019-06-01)
    Let $Gamma=(G,sigma)$ be a signed graph, where $G$ is the underlying simple graph with at least one edge and $sigma : E(G) longrightarrow lbrace -,+rbrace$ is the sign function on the edges of $G$. In this paper, we study ...

  • k رکوردها، تعاریف و مفاهیم اساسی 

    نیلی ثانی, pحمید رضا؛ نوری, محمد (انجمن آمار ایران, 2013-03-01)
    !mso]> v:* {behavior:url(#default#VML)} o:* {behavior:url(#default#VML)} w:* {behavior:url(#default#VML)} .shape {behavior:url(#default#VML)} gte mso 9]>l> gte mso 9]>l> Normal 0 false ...

  • $k$-odd mean labeling of prism 

    Gayathri, B.؛ Amuthavalli, K. (University of Isfahan, 2015-03-01)
    ‎A $(p,q)$ graph $G$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎V‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $E$ by $f^*(uv) ...

  • $K$-orthonormal and $K$-Riesz Bases 

    Ahmdi, Ahmad؛ Ahmdi, Ahmad؛ Rahimi, Asghar؛ Rahimi, Asghar (University of Maragheh, 2021-02-01)
    Let $K$ be a bounded operator. $K$-frames are ordinary frames for the range $K$. These frames are a generalization of ordinary frames and are certainly different from these frames. This research introduces a new concept ...

  • $k$-power centralizing and $k$-power skew-centralizing maps on‎ ‎triangular rings 

    Qi, X. F. (Springer and the Iranian Mathematical Society (IMS), 2016-06-01)
    ‎Let $mathcal A$ and $mathcal B$ be unital rings‎, ‎and $mathcal M$‎ ‎be an $(mathcal A‎, ‎mathcal B)$-bimodule‎, ‎which is faithful as a‎ ‎left $mathcal A$-module and also as a right $mathcal B$-module‎.  ‎Let ${mathcal ...

  • $k$-Total difference cordial graphs 

    Ponraj, R؛ Doss Philip, S.Yesu؛ Kala, R (University of Tehran, 2019-06-01)
    Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if ...

  • $k$-Total prime cordial labeling of graphs 

    Ponraj, R؛ Maruthamani, J؛ Kala, R (University of Tehran, 2018-06-01)
    In this paper we introduce a new graph labeling method called $k$-Total prime cordial. Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the ...

  • $k$-Tuple total domination and mycieleskian graphs 

    P. Kazemi, Adel (University of Isfahan, 2012-03-01)
    ‎Let $k$ be a positive integer‎. ‎A subset $S$ of $V(G)$ in a graph $G$‎ ‎is a $k$-tuple total dominating set of $G$ if every vertex of $G$‎ ‎has at least $k$ neighbors in $S$‎. ‎The $k$-tuple total domination‎ ‎number ...

  • $k$-tuple total restrained domination/domatic in graphs 

    P. Kazemi, Adel (Springer and the Iranian Mathematical Society (IMS), 2014-06-01)
    ‎For any integer $kgeq 1$‎, ‎a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-‎tuple total dominating set of $G$ if any vertex‎ ‎of $G$ is adjacent to at least $k$ vertices in $S$‎, ‎and any vertex‎ ‎of $V-S$ is adjacent ...

  • $k$-جبرهای متناهی نمایش و $C^infty$-حلقه های متناهی مولد 

    خان جان زاده, زینب؛ معدنشکاف, علی (دانشگاه اصفهان, 2017-05-22)
    .در این مقاله ابتدا به تبیین سیر تاریخی پیدایش توپولوژی زاریسکی روی حلقه های چندجمله ای های با ضرایب مختلط می پردازیم. سپس، برای حلقه جابجایی و یکدار مفروض $k$، قصد داریم یکی از ساختارهای موجود روی دوگان رسته $k$-جبرهای ...

  • K-Complex Detection Based on Synchrosqueezing Transform 

    Ghanbari Garakani, Zahra؛ Moradi, Mohammad Hasan (2017-12-01)
    K-complex is an underlying pattern in the sleep EEG. Due to the role of sleep studies inneurophysiologic and cognitive disorders diagnosis, reliable methods for analysis and detection of this patternare of great ...

  • k-Efficient partitions of graphs 

    Chellali, M؛ Haynes, Teresa؛ Hedetniemi, Stephen T. (Azarbaijan Shahid Madani University, 2019-12-01)
    A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we ...

  • k-equitable mean labeling 

    Jeyanthi, P. (University of Tehran, 2013-12-01)

  • K-FLAT PROJECTIVE FUZZY QUANTALES 

    Lu, Jing؛ Wang, Kaiyun؛ Zhao, Bin (University of Sistan and Baluchestan, 2017-10-01)
    In this paper, we introduce the notion of {bf K}-flat projective fuzzy quantales, and give an elementary characterization in terms of a fuzzy binary relation on the fuzzy quantale. Moreover, we  prove that {bf K}-flat ...

  • k-forested choosability of graphs with bounded maximum average degree 

    Zhang, X.؛ Liu, G.؛ Wu, J. (Springer and the Iranian Mathematical Society (IMS), 2012-04-01)
    A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given ...

  • K-fractional integral inequalities of Hadamard type for (h − m)−convex functions 

    Farid, Ghulam؛ Rehman, Atiq؛ Ain, Qurat (University of Tabriz, 2020-01-01)
    In this paper, we establish Hadamard type fractional integral inequalities for a more general class of functions that is the class of (h _ m)_convex functions. These results are due to Riemann-Liouville (RL) k-fractional ...

  • k-Intersection Graph of a Finite Set 

    ESMAEELI, FAHIMEH؛ Erfanian, Ahmad؛ MANSOORI, FARZANEH (University of Kashan, 2019-12-01)
    For any nonempty set Ω and k-subset Λ, the k-intersection graph, denoted by Γm(Ω,Λ), is an undirected simple graph whose vertices are all m-subsets of Ω and two distinct vertices A and B are adjacent if and only if A∩B ⊈ ...

  • K-MEANS BASED MULTIMODAL BIOMETRIC AUTHENTICATION USING FINGERPRINT AND FINGER KNUCKLE PRINT WITH FEATURE LEVEL FUSION 

    پدیدآور نامشخص (Shiraz University, 2013-12-01)
    In general, identification and verification are done by passwords, pin number, etc.,which are easily cracked by others. To overcome this issue, biometrics has been introduced as aunique tool to authenticate an individual ...

  • K-NACCI SEQUENCES IN MILLER’S GENERALIZATION OF POLYHEDRAL GROUPS 

    DEVECİ, Ömür؛ KARADUMAN, O. (Springer, 2010-12-01)
    A k-nacci sequence in a finite group is a sequence of group elements x0 , x1, x2 ,, xn , forwhich, given an initial (seed) set 0 1 2 1 , , , ,j x x x x  , each element is defined by0 1 11 1for ,for .nnn k n k nxx x j ...

  • K-nilpotent groups based on hypergroups 

    Mosayebi Dorcheh, Ali (University of Hatef, 2021-05-01)
    Fundamental relations are one of the main tools in connection relation between hyperstructures theory and structures theory. In this paper, we introduce a general fundamental relation on any hypergroup in such a way that ...