ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Biology
Research
Literature
Technology
Social Sciences
Pure sciences
Languages
Architecture and Urbanism
Public health
all records (75)

Languages
English
Portuguese
Spanish
German
French

Countries
Indonesia
USA
Brazil
Spain
Denmark
Ukraine
Italy
South Africa
India
Canada
all records (80)

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

Filter  
 
8.803  Articles
1 of 881 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 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

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

Arabian Gulf archeology The Eighth Campaign of the Danish Archeological Expedition 1961/62During the winter of 1961/62 the expedition sent out from the Forhistorisk Museum in Aarhus continued its work on the Arabian littoral of the Arabian Gulf, operating... see more

Arabian Gulf archeology The Eighth Campaign of the Danish Archeological Expedition 1961/62During the winter of 1961/62 the expedition sent out from the Forhistorisk Museum in Aarhus continued its work on the Arabian littoral of the Arabian Gulf, operating... see more

A retracting-free bidirectional double tracing in a graph G is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the opposite direction. Studying the class&nb... 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

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

1 of 881 pages  |  10  records  |  more records»