ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Mathematics
Technology
Social Sciences
Research
Architecture and Urbanism
Biology
Environment
Literature
Geography
all records (75)

Languages
English
Spanish
Portuguese
German

Countries
Brazil
Indonesia
USA
Spain
Denmark
Ukraine
Italy
Australia
Chile
South Africa
all records (81)

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

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

Let G be a connected, simple and undirected graph. The assignments {0, 2, …, 2kv} to the vertices and {1, 2, …, ke} to the edges of graph G are called total k-labelings, where k = max{ke, 2kv}. The total&n... see more

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

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

Let G(V, E) be a finite simple graph and k be some positive integer. A vertex k-labeling of graph G(V,E), F : V ? {1,2,..., k}, is called edge irregular k-labeling if the edge weights of any two&... 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

In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making software tools, coding theory and path determination in n... see more

1 of 967 pages  |  10  records  |  more records»