نتایج جستجو برای: graph theory and matrix approach
تعداد نتایج: 17150322 فیلتر نتایج به سال:
the present study attempts to discover ideological differences between alcott’s novel (1868) named “little women” and its two persian translations. the first has been translated by morvarid and the second has been translated by obeidi. to this end, farahzad’s cda approach (2012) was used to analyze the ideology reflected in both translations by the two different translators. according to farahz...
this studyinvestigated therelations between examinees’ academic knowledge and theirperformanceonreading section of ielts and toefl (ibt) through using generalizabilitytheory. g-theory was utilized to investigate the effects of subtest, test items, participants and academic background on the reliability of ielts and toefl (ibt) score. tosamplethe subjectsofthissurvey,a placement testwasadministe...
In 2006, Espinola and Kirk made a useful contribution on combining fixed point theoryand graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using the main idea of their work and the idea of combining fixed point theory on intuitionistic fuzzy metric spaces and graph theory, ...
w. a. dudek, m. shahryari, representation theory of polyadic groups, algebra and representation theory, 2010. و a. borowiec, w. a. dudek, s. duplij, bi-element representations of ternary groups, comminications in algebra 34 (2006). هدف اصلی این پایان نامه، معرفی نمایش های گروه های n-تایی و بررسی ویژگی های اصلی آن ها با تمرکز روی گروه های سه تایی است.
food safety is considered as an important world concern. the detection of pathogen and toxic materials in food has an important role in public health care. in recent years, the applications of microbial biosensor have been developed as a new approach for toxicity control. luminescent microbial biosensor is an appropriate biological tool for protection of natural environment. this type of biosen...
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
Security in today’s world is one of the important challenges. Encryption is one of the popular methods to achieve secret communication between sender and receiver. Graph theory is widely used as a tool of encryption, due to its various properties and its easy representation in computers as a matrix. In this paper we introduce an enhanced approach of elliptic curve encryption algorithm for achie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید