|
|
|
|
|
Isnaini Rosyida and Christiana Rini Indrati
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agus Irawan, Asmiati Asmiati, La Zakaria and Kurnia Muludi
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by ????(??)
?
L
(
G
)
. This...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Gurski, Dominique Komander and Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yan Han, Xiaoxing Yan and Yu Tao
Embedding melamine-formaldehyde (MF) resin-coated shellac microcapsules in waterborne coatings can extend the service longevity of waterborne coatings on a wood surface to a certain extent. Due to the content limitation of self-repairing microcapsules in...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yi Weng, Junyi Wang and Zhongqi Pan
This paper provides a technical review regarding the latest progress on multi-input multi-output (MIMO) digital signal processing (DSP) equalization techniques for high-capacity fiber-optic communication networks. Space division multiplexing (SDM) techno...
ver más
|
|
|
|
|
|