ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

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

Languages
English
Spanish
Portuguese
German
Finnish
French

Countries
Indonesia
USA
Australia
Austria
Ukraine
Brazil
South Africa
Germany
Canada
Switzerland
all records (71)

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

Filter  
 
186.306  Articles
1 of 18.632 pages  |  10  records  |  more records»
In a fuzzy set (FS), there is a concept of alpha-cuts of the FS for alpha in [0,1]. Further, this concept was extended into (alpha,delta)-cuts in an intuitionistic fuzzy set (IFS) for delta in [0,1]. One of the expansions of FS and IFS is the picture fuzz... see more

In a fuzzy set (FS), there is a concept of alpha-cuts of the FS for alpha in [0,1]. Further, this concept was extended into (alpha,delta)-cuts in an intuitionistic fuzzy set (IFS) for delta in [0,1]. One of the expansions of FS and IFS is the picture fuzz... see more

University Course Timetabling Problem merupakan proses penjadwalan mata kuliah di sebuah universitas yang hasilnya diusahakan seoptimal mungkin untuk tidak saling berbenturan dengan batasan-batasan dan syarat-syarat (constraints) tertentu. Dalam menentuka... see more

In college, lecture scheduling is very important in lecturing process, because the activities of lecturers and students depend on lecture schedule. To solve the problem, use Vertex GraphColoring and Simulated Annealing. In Vertex Graph Coloring, look for ... see more

The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E ? {1, 2, ?, |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u) ? w(v) where w(u) = Se ? E(u)f(e) and E(u)... see more

Let G=(V,E) be connected graph. A bijection f : E ? {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ? V satisfies w(u)? w(v), where w(u)=?e?E(u) f(e), E(u) is the set of edges incident to u. ... see more

Recently, we have introduced two graph-decomposition theorems based on a new graph product, motivated by applications in the context of synchronising periodic real-time processes. This vertex-removing synchronised product (VRSP) is based on modifications ... 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

The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V(G)?{1, 2, …, k} whose induced edge labels {c(u),c(v)} are distinct for al... see more

1 of 18.632 pages  |  10  records  |  more records»