ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Economy
Social Sciences
Technology
Mathematics
Agronomy and forestry
Law
Religion
Biology
Computing
all records (72)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Germany
Ukraine
Australia
Brazil
Turkey, Turkish Republic
Romania
South Africa
Russia
all records (71)

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

Filter  
 
75.783  Articles
1 of 7.579 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

Let c : V(G)?{1, 2, …, k} be a proper k-coloring of a simple connected graph G. Let ? = {C1, C2, …, Ck} be a partition of V(G), where Ci is the set of vertices of G receiving color i. The color c... see more

The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinali... see more

Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (? 6) and having locating-chromatic number n-3.

Let G(V,E) be a simple graph and f be a bijection f : V ? E ? {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ? V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label its... see more

The investigation on the locating-chromatic number of a graph was initiated by Chartrand et al. (2002). This concept is in fact a special case of the partition dimension of a graph. This topic has received much attention. However, the results ar... see more

In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n)  and  T(K1,n) respectively. We discuss the relationship between b-chromatic number with some other typ... see more

Fibonacenes are unbranched catacondensed benzenoid hydrocarbons in which all the non-terminal hexagons are angularly annelated. A hexagon is said to be angularly annelated if the hexagon is adjacent to exactly two other hexagons and possesses two adjacent... see more

Among the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is c... see more

1 of 7.579 pages  |  10  records  |  more records»