نتایج جستجو برای: vertex degree
تعداد نتایج: 332657 فیلتر نتایج به سال:
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...
The vertex arboricity of graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces an acyclic subgraph of G. We prove results such as this: if a connected graph G is neither a cycle nor a clique, then there is a coloring of V(G/ with at most [-A(G)/2 ~ colors, such that each color class induces a forest and one of those induced forests ...
Let G be a finite non-abelian group and Z(G) its center. We associate commuting graph $$\Gamma (G)$$ to G, whose vertex set is $$G\setminus Z(G)$$ two distinct vertices are adjacent if they commute. In this paper we prove that the of all groups has maximum degree bounded above by fixed $$k \in {\mathbb {N}}$$ finite. Also, characterize for which associated graphs have at most 4.
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
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...
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.
The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...
if $g$ is a connected graph with vertex set $v$, then the eccentric connectivity index of $g$, $xi^c(g)$, is defined as $sum_{vin v(g)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. in this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید