نتایج جستجو برای: total vertex irregularity strength

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

Journal: :Kragujevac journal of mathematics 2022

Let R be a commutative ring and Z(R) the set of all zero divisors R. Γ(R) is said to divisor graph if x,y ∈ V (Γ(R)) = (x,y) E(Γ(R)) only x.y 0. In this paper, we determine total vertex irregularity strength graphs associated with rings ℤp2 × Zq for p,q prime numbers.

The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.

Journal: :iranian journal of mathematical chemistry 2015
m. eliasi

the total irregularity of a graph g is defined as 〖irr〗_t (g)=1/2 ∑_(u,v∈v(g))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈v(g). in this paper by using the gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.

Journal: :Discussiones Mathematicae Graph Theory 2006
Jaroslav Ivanco Stanislav Jendrol

A total edge-irregular k-labelling ξ : V (G) ∪ E(G) → {1, 2, . . . , k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which a graph G has a total edge-irregular k-lab...

In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...

2012
Hosam Abdo Darko Dimitrov

In this note a new measure of irregularity of a simple undirected graph G is introduced. It is named the total irregularity of a graph and is defined as irrt(G) = 1 2 ∑ u,v∈V (G) |dG(u)− dG(v)| , where dG(u) denotes the degree of a vertex u ∈ V (G). The graphs with maximal total irregularity are determined. It is also shown that among all trees of same order the star graph has the maximal total...

Journal: :International Journal of Computer Applications 2012

Journal: :Journal of Physics: Conference Series 2019

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

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