ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Agronomy and forestry
Biology
Environment
Public health
Technology
Economy
Social Sciences
Food and nutrition
Research
all records (72)

Languages
English
Spanish
Portuguese
French

Countries
Indonesia
USA
Turkey, Turkish Republic
South Africa
Brazil
Denmark
India
Pakistan
Canada
Ukraine
all records (73)

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

Filter  
 
806.027  Articles
1 of 80.604 pages  |  10  records  |  more records»
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

Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-label... see more

The total edge irregular k-labeling of a graph G=(V,E) is the labeling of vertices and edges of G in such a way that for any different edges their weights are distinct. The total edge irregularity strength, tes (G), is defined as the minimum k for which G... see more

An edge irregular total k-labeling f : 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 two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinct. T... 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

Under a totally irregular total k-labeling of a graph G = (V,E), we found that for some certain graphs, the edge-weight set W(E) and the vertex-weight set W(V) of G which are induced by k = ts(G), W(E... see more

Let ?? = (??, ??) be a graph. A total labeling ??: ?? ? ?? ? {1, 2, ? , ??} iscalled a totally irregular total ??-labeling of ?? if every two distinct vertices ?? and?? in ?? satisfy ????(??) ? ????(??) and every two distinct edges ??1??2 and ??1??2 in ??... see more

1 of 80.604 pages  |  10  records  |  more records»