ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Education
Technology
Computing
Research
Computing
Social Sciences
Law
Economy
Architecture and Urbanism
all records (69)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Australia
Brazil
South Africa
Chile
Canada
Italy
Germany
Ukraine
all records (66)

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

Filter  
 
2.411  Articles
1 of 242 pages  |  10  records  |  more records»
Let G be a graph with p vertices and q edges and A = {0,2,4,···, q+1} if q is odd or A = {0,2,4,···,q} if q is even. A graph G is said to be an even vertex equitable even labeling if there exists a vertex labeling f : V (G) ? A that induces an edge labeli... see more

Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V (G) ? A that induces an edge l... see more

In this paper, we introduce a new labeling called odd vertex equitable even labeling. Let G be a graph with p vertices and q edges and A = {1, 3,..., q} if q is odd or A = {1, 3,..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable ... see more

Let G be a graph with p vértices and q edges and A = {0,1, 2,..., [q/2]}. A vertex labeling f : V(G) ? A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ? A, let vf (a) be the number of vertices v with f (... see more

Let G(V,E) be a simple graph and f be a bijection f : V ? E ? {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ? V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label its... see more

In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices. In this work we study one of these functi... see more

A super vertex mean labeling f of a (p, q) - graph G = (V,E) is defined as an injection from E to the set {1, 2, 3, ··· , p + q} that induces for each vertex v the label defined by the rule fv(v) = Round  , where Ev denotes the set of edges in G that... see more

A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V ? {1, 2, 3, ··· p} such that the induced function f * : E ? {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v))(mod... 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

1 of 242 pages  |  10  records  |  more records»