ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Architecture and Urbanism
Computing
Biology
Literature
Languages
Social Sciences
all records (75)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Brazil
Australia
Ukraine
Chile
Italy
South Africa
India
Denmark
all records (80)

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

Filter  
 
11.168  Articles
1 of 1.118 pages  |  10  records  |  more records»
Let G be a (p,q) graph. A mapping f : V (G) ? {0, 1, 2} is called 3-product cordial labeling if |v????(i) - v???? (j)| = 1 and |e???? (i) - e???? (j)| = 1 for any i, j ? {0, 1, 2},where v???? (i) denotes the number of vertices labeled with i, e???? (i) de... see more

Let G = (V(G), E(G)) be a connected graph, where V(G) is the set of vertices and E(G) is the set of edges. The set Dt(G) is called the total domination set in G if every vertex v 2 V(G) is adjacent to at least one vertex in Dt (G). Furthermore, Dt(G) must... see more

Let G be a (p, q)-graph. Let f : V(G) ? {1, 2, …, k} be a map where k is an integer, 2 = k = p. For each edge uv, assign the label |f(u) - f(v)|. f is called k-difference cordial labeling of G if |vf(i) - vf(j)| = 1 and |ef(0) - ef(1)| = 1 where vf(x) den... 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

This article shows the study about the harmonious coloring and to investigate the harmonious chromatic number of the central graph of quadrilateral snake, double quadrilateral snake, triple quadrilateral snake, k-quadrilateral snake, alternate quadrilater... see more

Let G be a (p, q) graph. Let f : V (G) ? {1, 2, . . . , k} be a map where k is an integer 2 = k = p. For each edge uv, assign the label |f (u) - f (v)|. f is called k-difference cordial labeling of G if |vf (i) - vf (j)| = 1 and |ef (0) - ef (1)| = 1 wher... 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 prove the existence of the adjacent vertex distinguishing total coloringnof quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake and double alternate quadrilateral snake in detail. Also, we present an algorithm ... see more

For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ? K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n. In this paper we show that... see more

1 of 1.118 pages  |  10  records  |  more records»