نتایج جستجو برای: resistance distance in graphs

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

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و زبانهای خارجی 1390

august wilson is undoubtedly one of the rare black playwrights whose works have attracted streams of attention and worldwide audience. the present study aims at analyzing fences and piano lesson which are two of the most successful plays in his pittsburgh cycle from the perspective of michel foucault’s theories and ideas. studying these two plays from foucault’s perspective opens new windows in...

Journal: :iranian journal of mathematical chemistry 2016
a. behtoei m. anbarloei

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.

Journal: :Czechoslovak Mathematical Journal 1976

2012
Alireza Abdollahi G. Yu

Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR(G) = ∑ fu,vg V (G)[d(u) +d(v)]R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between u and v. In this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance.

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

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

boron nitride semiconducting zigzag swcnt, $b_{cb}$$n_{cn}$$c_{1-cb-cn}$, as a potential candidate for making nanoelectronic devices was examined. in contrast to the previous dft calculations, wherein just one boron and nitrogen doping configuration have been considered, here for the average over all possible configurations, density of states (dos) was calculated in terms of boron and nitrogen ...

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...

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

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