نتایج جستجو برای: vertex pi index
تعداد نتایج: 474882 فیلتر نتایج به سال:
Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
let g be a simple graph with vertex set v(g) {v1,v2 ,...vn} . for every vertex i v , ( ) i vrepresents the degree of vertex i v . the h-th order of randić index, h r is defined as the sumof terms1 2 11( ), ( )... ( ) i i ih v v vover all paths of length h contained (as sub graphs) in g . inthis paper , some bounds for higher randić index and a method for computing the higherrandic ind...
the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...
let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih v v v over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...
A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the "Omega" W(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut "qoc" edge strips in a polycyclic graph. In this paper, the vertex PI, Szeged and omega polynomials of carbon nanocones CNC4[n] are computed.
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
مقدمه و هدف به دنبال ابتلا به نارسایی مزمن کلیوی تغییراتی در برخی از اجزای خونی رخ میدهد. بیماران دچار نارسایی کلیوی که تحت درمان های همودیالیز و دیالیز صفاقی قرار میگیرند، از مشکلات دهانی که مرتبط با تغییرات اجزای خونی آنها میباشد، رنج میبرند. هدف از این مطالعه مقایسه یافته های دهانی بیماران همودیالیزی و دیالیز صفاقی مراجعه کننده به بیمارستان فوق تخصصی دکتر شیخ مشهد با افراد سالم و تعیین ارتب...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید