نتایج جستجو برای: types of graphs
تعداد نتایج: 21183499 فیلتر نتایج به سال:
Preferential attachment networks are a type of random network where new nodes connected to existing ones at random, and more likely connect those that already have many connections. We investigate further family models introduced by Antunovi\'{c}, Mossel R\'{a}cz each vertex in preferential graph is assigned type, based on the types its neighbours. Instances this process proportions present do ...
the center (periphery) of a graph is the set of vertices with minimum (maximum)eccentricity. in this paper, the structure of centers and peripheries of some classes ofcomposite graphs are determined. the relations between eccentricity, radius and diameterof such composite graphs are also investigated. as an application we determinethe center and periphery of some chemical graphs such as nanotor...
abstract: in the paper of black and scholes (1973) a closed form solution for the price of a european option is derived . as extension to the black and scholes model with constant volatility, option pricing model with time varying volatility have been suggested within the frame work of generalized autoregressive conditional heteroskedasticity (garch) . these processes can explain a number of em...
mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
چکیده اهمیت اشیاء در نگاه انسان از آغاز پیدایش در زندگی جریان داشته و تاکنون نیز ادامه دارد. ساخت اشیاء از انواع کاربردی و آئینی آغاز و تا انواع الکترونیکی آن به همزیستی مسالمت آمیزی با انسان منتهی گشته است. حال اینکه این همزیستی در هر دوره ای از تاریخ چگونه خودنمایی می کند از اهمیت بسیاری برخوردار است.این رساله به بررسی موقعیت شی از جنبه های زیبایی شناسی، هویت مداری، نمادگرایی، جامعه شناسی ...
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید