ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Research
Library and Museology
Biology
Computing
Architecture and Urbanism
Pure sciences
Education
all records (73)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Denmark
Australia
Italy
Ukraine
Canada
Chile
Spain
all records (73)

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

Filter  
 
3.982  Articles
1 of 399 pages  |  10  records  |  more records»
Suppose G=(V,E) is a graph with the vertex set V(G) and edge set E(G) we defined a labeling f:V?E?{1,2,…,k} to be an edge irregular total k-labeling of graph G if for every two different edge e and f there is wt(e)?wt(f). The minimum k for which the graph... see more

Relationships of mammals to habitat edges is a continuing concern for conservation as habitat fragmentation continues and ratios of edge to interior habitat increase.  Mammal species that respond negatively to habitat edges may be at greater risk of ... see more

This paper presented a new algorithm for determining the distance of an object in front of a stereo camera placed on a helmet. By using a stereo camera with a Sum of Absolute Difference with a Sobel edge detector, our previous Grid-Edge-Depth map algorith... see more

For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e' of G, the edge metric S-representation of e'=ab is the vector rGe(e'|S)=(dG(e',v1),…,dG(e',vk)) , where dG(... see more

Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k-labeling ? such that the vertices of graph G are labeled with {0, 2, 4, . . . , 2kv} a... see more

An edge-ordering of a graph G=(V,E)G=(V,E) is a bijection ?:E?{1,2,…,|E|}\phi:E\to\{1,2,\ldots,|E|\}. Given an edge-ordering, a sequence of edges P=e1,e2,…,ekP=e_1,e_2,\ldots,e_k is an increasing path if it is a path in GG which satisfies ?(ei)<?(ej)\p... see more

Fokus penelitian ini pada eksperimen Quantum Hadamard Edge Detection (QHED) untuk pendeteksian tepi suatu gambar dimana jumlah qubit yang digunakan ternyata sangat mempengaruhi waktu pemrosesan CPU. Penelitian ini mengunakan benchmark dataset gambar yaitu... see more

For any two vertices u and v in a connected graph G = (V, E), a u - v path P is called a u - v triangle free path if no three vertices of P induce a triangle. The triangle fre... see more

Let G be a connected, simple and undirected graph. The assignments {0, 2, …, 2kv} to the vertices and {1, 2, …, ke} to the edges of graph G are called total k-labelings, where k = max{ke, 2kv}. The total&n... see more

1 of 399 pages  |  10  records  |  more records»