ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Computing
Architecture and Urbanism
Literature
Research
Languages
Pure sciences
all records (74)

Languages
English
Spanish
German
Portuguese
French
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Chile
Italy
Spain
South Africa
Switzerland
all records (78)

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

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

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

Given a list L(v) for each vertex v, we say that the graph G is L-colorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely k-list colorable if there is a list assignment L such that jL(v)j = ... 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

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

1 of 994 pages  |  10  records  |  more records»