ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Mathematics
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.768  Articles
1 of 978 pages  |  10  records  |  more records»
A vi-simultaneous proper k-coloring of a graph G is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set V(G)?I(G) receive distinct colors, where I(G) is t... 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

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

Many things in this world are implementations of graph coloring, because the models are very useful for broad applications, such as registration and scheduling of web-based instructor data. The purpose of this study is to support the virtual training proc... 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

A proper edge coloring of a class 2 graph G is minimal if it contains a color class of cardinality equal to the resistance r(G) of G, which is the minimum number of edges that have to be removed from G to obtain a graph which is ?(G)-edge colorable, ... see more

A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number ?s (G) of G is the least number of colors needed to star color G. In this paper, we have generalized the star ch... see more

A star edge coloring of a graph G is a proper edge coloring without bichromatic paths and cycles of length four. In this paper, we obtain the star edge chromatic number of the corona product of path with cycle, path with wheel, path with helm and path wit... see more

1 of 978 pages  |  10  records  |  more records»