نتایج جستجو برای: graph theory and matrix approach
تعداد نتایج: 17150322 فیلتر نتایج به سال:
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...
in this investigation the effect of external field on the electron density of nanostructures of cds, cdse, cdte, gaas and polymeric structure of three, four, five and six units of cds as a kind of nanosolar cells has been studied theoretically. as modeling this system in nanodimension, molecular structures has used. specific properties of molecular structures permit us to consider different sym...
چکیده : نظریه ی شیوه ی تولید آسیایی ، اولین بار توسط مارکس و سپس در تأیید نظریات او ، در آثار انگلس مطرح شد . این نظریه علاوه بر شیوه تولید ، به بحث درباره ی ماهیت دولت در جوامع آسیایی می پردازد . در این پژوهش ، وجه تولید آسیایی و نظریات پیرامون آن در توسعه نیافتگی ایران ، مورد بحث و بررسی قرار می گیرند . مهمترین نظ the asian production theory was first introduced by marx and then was suppo...
Let $G$ be a graph of order $n$ with vertices labeled as $v_1, v_2,dots , v_n$. Let $d_i$ be the degree of the vertex $v_i$ for $i = 1, 2, cdots , n$. The Albertson matrix of $G$ is the square matrix of order $n$ whose $(i, j)$-entry is equal to $|d_i - d_j|$ if $v_i $ is adjacent to $v_j$ and zero, otherwise. The main purposes of this paper is to introduce the Albertson ...
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$ ...
in the process of structural analysis we often come to structures that can be analyzed with simpler methods than the standard approaches. for these structures, known as regular structures, the matrices involved are in canonical forms and their eigen-solution can be performed in a simple manner. however, by adding or removing some elements or nodes, such methods cannot be utilized. here, an effi...
altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
magnetic resonance imaging (mri) is a notable medical imaging technique that makes of phenomenon of nuclear magnetic resonance. because of the resolution and the technology being harmless, mri has considered as the most desirable imaging technique in clinical applications. the visual quality of mri plays an important role in accuracy of medical delineations that can be seriously degraded by exi...
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید