ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Social Sciences
Literature
Languages
Computing
Research
Economy
Religion
all records (76)

Languages
English
Portuguese
Spanish
German
French
Finnish

Countries
Indonesia
Brazil
USA
Australia
South Africa
Italy
Chile
Ukraine
Germany
Cuba
all records (78)

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

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

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

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

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



A graph G(p, q) is said to be odd harmonious if there exists an in-jection f : V(G)? {0,1, 2, ..., 2q — 1} such that the induced function f * : E(G) ? {1, 3, ... 2q — 1} defined by f * (uv) = f (u) + f (v) is a bijection. A graph that admits odd harm... see more

Let G be a connected plane graph with vertex set V and edge set E. For X ? {V, E, V ? E}, two elements of X are facially adjacent in G if they are incident elements, adjacent vertices, or facially adjacent edges (edges that are consecutive ... see more

A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) ? {0, 1, 2, · · · , 2q - 1} such that the induced function f* : E(G) ? {1, 3, · · · , 2q - 1} defined by f* (uv) = f (u) + f (v) is a bijection. In this paper we prove tha... see more

1 of 7.793 pages  |  10  records  |  more records»