نتایج جستجو برای: distance of graph

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

Journal: :bulletin of the iranian mathematical society 0
r. k. zaferani

0

Journal: :transactions on combinatorics 2016
yaoping mao zhao wang ivan gutman

the wiener index $w(g)$ of a connected graph $g$‎ ‎is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$‎ ‎where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of‎ ‎$g$‎. ‎for $ssubseteq v(g)$‎, ‎the {it steiner distance/} $d(s)$ of‎ ‎the vertices of $s$ is the minimum size of a connected subgraph of‎ ‎$g$ whose vertex set is $s$‎. ‎the {it $k$-th steiner wiener index/}‎ ‎$sw_k(g)$ of $g$ ...

Journal: :transactions on combinatorics 2013
mardjan hakimi-nezhaad ali reza ashrafi ivan gutman

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...

Journal: :transactions on combinatorics 2014
jaisankar senbagamalar jayapal baskar babujee ivan gutman

let $g$ be an $(n,m)$-graph. we say that $g$ has property $(ast)$if for every pair of its adjacent vertices $x$ and $y$, thereexists a vertex $z$, such that $z$ is not adjacentto either $x$ or $y$. if the graph $g$ has property $(ast)$, thenits complement $overline g$ is connected, has diameter 2, and itswiener index is equal to $binom{n}{2}+m$, i.e., the wiener indexis insensitive of any other...

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

the speech act of disagreement has been one of the speech acts that has received the least attention in the field of pragmatics. this study investigates the ways power relations, social distance, formality of the context, gender, and language proficiency (for efl learners) influence disagreement and politeness strategies. the participants of the study were 200 male and female native persian s...

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

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

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

there is no doubt that human being needs to become integrated with industry and industry needs to be progressed, daily. on the other hand, serious events in industrial units specially in oil industries has been shown that such damages and events are industry related ones. the consequence of such events and damages which resulted in chemical and poisoned explosions and loss of life and property ...

Journal: :iranian journal of mathematical chemistry 2012
a. mahmiani o. khormali a. iranmanesh

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.

Journal: :iranian journal of mathematical chemistry 2013
m. tavakoli f. rahbarnia

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

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

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