Albertson [3] has defined the irregularity of a simple undirected graph G = (V,E) as irr(G) = ∑ uv∈E |dG(u)− dG(v)| , where dG(u) denotes the degree of a vertex u ∈ V . Recently, this graph invariant gained interest in the chemical graph theory, where it occured in some bounds on the first and the second Zagreb index, and was named the third Zagreb index [13]. For general graphs with n vertices...

A function ϕ : V ( G )→{1, 2, …, k } of a simple graph is said to be non-inclusive distance vertex irregular -labeling if the sums labels vertices in open neighborhood every are distinct and an inclusive closed each different. The minimum for which has (resp. inclusive) called irregularity strength denoted by d i s ) ). In this paper, join product graphs investigated.

Objectives Acrylic resins are one of the most important denture base materials in dentistry due to their favourable mechanical and physical properties. The purpose of present study is to compare 4 available acrylic flexural strength properties before and after thermocycling. Methods Acrylic resin specimens of Meliodent (Heraeus Kulzer, Hanau, Germany), Vertex (Vertex-dental BV, Zeist, Netherla...

A labeling of edges and vertices a simple graph \(G(V,E)\) by mapping \(\Lambda :V\left( G \right) \cup E\left( \to \left\{ { 1,2,3, \ldots ,\Psi } \right\}\) provided that any two pair have distinct weights is called an edge irregular total \(\Psi\)-labeling. If \(\Psi\) minimum \(G\) admits -labelling, then the irregularity strength (TEIS) denoted \(\mathrm{tes}\left(G\right).\) In this paper...

For a simple graph G with no isolated edges and at most, one vertex, labeling ?:E(G)?{1,2,…,k} of positive integers to the is called irregular if weights vertices, defined as wt?(v)=?u?N(v)?(uv), are all different. The irregularity strength known maximal integer k, minimized over labelings, set ? such exists. In this paper, we determine exact value modular fan graphs.

An edge irregular total k-labeling φ : V ∪ E → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges uv and u′v′ their weights φ(u) +φ(uv) +φ(v) and φ(u′) +φ(u′v′) +φ(v′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. In this paper, we...

Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) → {1, 2, . . . , w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct. The smallest w for which there exists an irregular assignment on G is called the irreg...