ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Research
Architecture and Urbanism
Technology
Environment
Biology
Geography
Pure sciences
Mathematics
all records (74)

Languages
English
Spanish
Portuguese
German

Countries
Brazil
Indonesia
USA
Spain
Ukraine
Italy
Chile
Denmark
Colombia
Cuba
all records (76)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
6.002  Articles
1 of 601 pages  |  10  records  |  more records»
Let G = (V(G),E(G)) be a graph with the nonempty vertex set V(G) and the edge set E(G). Let Zn be the group of integers modulo n and let k be a positive integer. A modular irregular labeling of a grap... see more

We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.

Suppose G=(V,E) is a graph with the vertex set V(G) and edge set E(G) we defined a labeling f:V?E?{1,2,…,k} to be an edge irregular total k-labeling of graph G if for every two different edge e and f there is wt(e)?wt(f). The minimum k for which the graph... see more

Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k-labeling ? such that the vertices of graph G are labeled with {0, 2, 4, . . . , 2kv} a... see more

Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke} ... see more

For a simple graph G, a vertex labeling f : V(G) ? {1, 2, ..., k} is called a k-labeling. The weight of a vertex v, denoted by wtf(v) is the sum of all vertex labels of vertices in the closed neighborhood of the vertex v. A vertex k-labeling is defined to... see more

A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)?E(G)?{1, 2, …, k} such that for every pair vertices u, v ? V(G) and u ? v, the weights of u and ... see more

A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling ? : V ? E? 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y)... see more

A function ?: V(G)?{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is s... see more

1 of 601 pages  |  10  records  |  more records»