ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Economy
Religion
Technology
Research
Architecture and Urbanism
Industrial engineer
Literature
Pure sciences
all records (74)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
Ukraine
South Africa
Chile
Germany
Canada
Russia
Argelia
all records (73)

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

Filter  
 
24.968  Articles
1 of 2.498 pages  |  10  records  |  more records»
Let G = (V, E) be a simple undirected graph. A labeling f : V(G)?{1, …, k} is a local inclusive d-distance vertex irregular labeling of G if every adjacent vertices x, y ? V(G) have distinct weights, with the w... 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

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

Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n = 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic gr... 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

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

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

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

1 of 2.498 pages  |  10  records  |  more records»