Results 11 to 20 of about 6,009 (241)
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph
Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring
Arika Indah Kristiana +2 more
doaj +1 more source
On the construction and comparison of graph irregularity indices [PDF]
Irregularity indices are generally used for quantitative characterization of topological structure of non-regular graphs. According to a widely accepted preconception, using a topological invariant (called a graph irregularity index) for that purpose ...
Réti Tamás, Tóth-Laufer Edit
doaj +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of inclusive local ...
Arika Indah Kristiana +2 more
doaj +1 more source
AN INCLUSIVE LOCAL IRREGULARITY VERTEX COLORING OF BOOK GRAPH FAMILY
Let is a simple and connected graph with as vertex set and as edge set. Vertex labeling on inclusive local irregularity vertex coloring is defined by mapping and the function of the inclusive local irregularity vertex coloring is with .
Robiatul Adawiyah +2 more
doaj +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
The graph in this paper is a simple and connected graph with V(G) is vertex set and E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of ...
Arika Indah Kristiana +2 more
doaj +1 more source
Irregularity Measure of Graphs
A simple graph G is said to be regular if its vertices have the same number of neighbors. Otherwise, G is nonregular. So far, various formulas, such as the Albertson index, total
Ali Ghalavand +2 more
openaire +2 more sources
LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS
One of the sub-chapters studied in graphs is local irregularity vertex coloring of graph. The based on definition of local irregularity vertex coloring of graph, as follow : (i)l : V (G) →{1, 2, 3, . . . , k} as a vertex irregular labeling and w : V (G) →
Ilmiatun Nuroeni +4 more
doaj +1 more source
The total irregularity of graphs under graph operations [PDF]
14 pages, 3 figures, Journal ...
Abdo, H., Dimitrov, D.
openaire +4 more sources
Irregularity measures of graph [PDF]
Let G = (V,E), V = {1,2 …, n}, be a simple graph without isolated vertices, with vertex degree sequence d1 ≥ d2 ≥ … ≥ dn > 0, di = d(i). A graph G is regular if and only if d1 = d2 = … = dn. A graph invariant I(G) is measure of irregularity of graph G with the property I(G)=0 if and only if G is regular, and I(G)>0 otherwise. In this paper we introduce
E. Milovanovic +3 more
openaire +1 more source
Irregularity and Modular Irregularity Strength of Wheels
It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. This means that no simple graph of the order of at least two is, in this way, irregular. However, a multigraph can be irregular.
Martin Bača +2 more
doaj +1 more source

