نتایج جستجو برای: vertex degree
تعداد نتایج: 332657 فیلتر نتایج به سال:
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twogr...
sufficient conditions on the zeroth-order general randic index for maximally edge-connected digraphs
let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید