ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Religion
Social Sciences
Mathematics
Technology
Law
Philosophy
Architecture and Urbanism
History
Literature
all records (66)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Ukraine
Australia
Brazil
Russia
Romania
Poland
South Africa
Germany
all records (57)

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

Filter  
 
1.830  Articles
1 of 183 pages  |  10  records  |  more records»
This article shows the study about the harmonious coloring and to investigate the harmonious chromatic number of the central graph of quadrilateral snake, double quadrilateral snake, triple quadrilateral snake, k-quadrilateral snake, alternate quadrilater... see more

In this paper, we present the structural properties of total graph of central graph of cycles Cn, star graphs K1,n and paths Pn denoted by T (C(Cn)), T (C(K1,n)) and T (C(Pn)) respectively. We mainly focus our discussion on the harmonious chromatic number... see more

This study described how the leadership of the principal in improving the work environment in SMA Negeri 1 Pendopo Empat Lawang District. This is descriptive qualitative research method. The subjects are personnel of Senior High School 1 Pendopo Collectio... see more

Democratic life is a dream for every person, every family, all the people and the state. A democratic life will knit a harmonious and peaceful atmosphere. Touches of humanism   instinct will ... see more

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

A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4 colors is... see more

For a family of geometric objects in the plane F={S1,…,Sn}\mathcal{F}=\{S_1,\ldots,S_n\}, define ?(F)\chi(\mathcal{F}) as the least integer l\ell such that the elements of F\mathcal{F} can be colored with l\ell colors, in such a way that any two intersect... see more

The Graph Coloring Problem (GCP) is assigning different colors to certain elements in a graph based on certain constraints and using a minimum number of colors. GCP can be drawn into optimization problems, namely the problem of minimizing the color used t... see more

Several of the most studied graph labelings are injective functions, this constraint precludes some graphs from admitting such labelings; a well-known example is given by the family of trees that cannot be harmoniously labeled. In order to study the exist... see more

1 of 183 pages  |  10  records  |  more records»