نتایج جستجو برای: graph theory and matrix approach
تعداد نتایج: 17150322 فیلتر نتایج به سال:
چکیده ندارد.
Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...
This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective resistance, is preserved between the directed graph and its symmetrized version. It is shown that the preservation of this metric allows for interpretation of alge...
the edge versions of reverse wiener indices were introduced by mahmiani et al. veryrecently. in this paper, we find their relation with ordinary (vertex) wiener index in somegraphs. also, we compute them for trees and tuc4c8(s) naotubes.
there are two major theories of measurement in psychometrics: classical test theory (ctt) and item-response theory (irt). despite its widespread and long use, ctt has a number of shortcomings, which make it problematic to be used for practical and theoretical purposes. irt tries to solve these shortcomings, and provide better and more dependable answers. one of the applications of irt is the as...
In this paper we extend and generalize the standard random walk theory (or spectral graph theory) on undirected graphs to digraphs. In particular, we introduce and define a (normalized) digraph Laplacian (in short, Diplacian) Γ for digraphs, and prove that 1) its Moore-Penrose pseudo-inverse is the (discrete) Green’s function of the Diplacian matrix (as an operator on digraphs), and 2) it is th...
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
in this project, 4,4?-methylenebis(3-chloro-2,6-diethyl trimellitimidobenzene) as a diacid, was prepared by the reaction of trimellitic anhydride (tma) with 4,4?-methylenebis(3-chloro-2,6-diethylaniline) (mcdea). the novel poly(amide-imide) (pai) was synthesized from the reaction of 4,4?-methylenebis(3-chloro-2,6-diethyl trimellitimidobenzene) as a diacid with mcdea under green condition using ...
An algebraic approach to finding all edge-weighted-colored paths within a weighted colored multidigraph is developed. Generally, the adjacency matrix represents a simple digraph and determines all paths between any two vertices, and is not readily extendable to colored multidigraphs. To bridge the gap, a conversion function is proposed to transform the original problem of searching edge-colored...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید