نتایج جستجو برای: laplacian energy of fuzzy graph

تعداد نتایج: 21269403  

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد شاهرود - دانشکده مهندسی شیمی 1389

on this project we try to calculated power of hydrogen on dycarbonil compound in different ways ; the first way is shoster way , for sain power of hydrogen notice the different power between central conforms on it and main conform that’s didn’t have hydrogen joint . or in other way different of energy between open and close form. second way, is average way? this is for way that studied conf...

Journal: :Symmetry 2022

Vague graphs (VGs), belonging to the fuzzy (FGs) family, have good capabilities when faced with problems that cannot be expressed by FGs. The notion of a VG is new mathematical attitude model ambiguity and uncertainty in decision-making issues. A vague graph structure (VFGS) generalization VG. It powerful useful tool find influential person various relations. VFGSs can deal associated inconsist...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ارومیه - دانشکده علوم 1391

nanotechnology is a general term which is related with field of all advanced science term that generally predicates with all modern technologies which consider nanoscales. improvement in the quality of products by adding some nanoparticles and study of their behavior in the presence of these nanoparticles have been obtained in many researches. on the other hand numerous demands for sowing ...

2013
Tianfei Wang Liping Jia Feng Sun

The Laplacian spectra are the eigenvalues of Laplacian matrix L(G) = D(G) - A(G), where D(G) and A(G) are the diagonal matrix of vertex degrees and the adjacency matrix of a graph G, respectively, and the spectral radius of a graph G is the largest eigenvalue of A(G). The spectra of the graph and corresponding eigenvalues are closely linked to the molecular stability and related chemical proper...

Journal: :transactions on combinatorics 2016
chandrashekar adiga b‎. ‎r‎. ‎rakshith

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

Journal: :CoRR 2017
Dimitri Van De Ville Robin Demesmaeker Maria Giulia Preti

Spectral approaches of network analysis heavily rely upon the eigendecomposition of the graph Laplacian. For instance, in graph signal processing, the Laplacian eigendecomposition is used to define the graph Fourier transform and then transpose signal processing operations to graphs by implementing them in the spectral domain. Here, we build on recent work that generalized Slepian functions to ...

2017
Dariush Kiani Maryam Mirzakhah DARIUSH KIANI MARYAM MIRZAKHAH

Let G be a mixed graph and L(G) be the Laplacian matrix of G. In this paper, the coefficients of the Laplacian characteristic polynomial of G are studied. The first derivative of the characteristic polynomial of L(G) is explicitly expressed by means of Laplacian characteristic polynomials of its edge deleted subgraphs. As a consequence, it is shown that the Laplacian characteristic polynomial o...

پایان نامه :دانشگاه بین المللی امام خمینی (ره) - قزوین - دانشکده معماری و شهرسازی 1393

چکیده نمایشگاه های جهانی یا اکسپو عنوانی ست که از سال 1851 میلادی در لندن توسط همسر ملکه انگلستان شکل گرفت ، هدف اولیه این نمایشگاه ها نمایش دستاورد های صنعتی بود، اما در طول 165 سال که این نمایشگاه های برگزار گردیدند ، رویکرد آنها تغییر کرده است . در هر دوره به یک شعار که در واقع دغدغه اصلی جهان، در آن زمان بوده است ، پاسخ داده شده و راه حل کشور های مختلف در مورد آن موضوع به نمایش گذارده شد...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سیستان و بلوچستان 1390

seismic retrofit strategies have been developed in the past few decades following the introduction of new seismic provisions and the availability of advanced materials and methods. it can be observed that new approaches to deal with more lateral forces are more innovative and more energy absorbent. in line with this, there is a growing trend toward the use of steel shear walls as a system with ...

Journal: :transactions on combinatorics 2015
r. b. bapat sivaramakrishnan sivasubramanian

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید