Results 1 to 10 of about 9,612,020 (345)
Local Antimagic Chromatic Number for Copies of Graphs [PDF]
Mathematics, 2021 An edge labeling of a graph G=(V,E) using every label from the set {1,2,⋯,|E(G)|} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all ...
Martin Bača +2 more
openalex +2 more sources
Chromatic Number and Neutrosophic Chromatic Number
, 2021 New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained.
Henry Garrett
semanticscholar +3 more sources
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER [PDF]
Forum of Mathematics, Sigma, 2016 The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj +4 more sources
Game Chromatic Number of Shackle Graphs
JTAM (Jurnal Teori dan Aplikasi Matematika), 2021 Coloring vertices on graph is one of the topics of discrete mathematics that are still developing until now. Exploration Coloring vertices develops in the form of a game known as a coloring game. Let G graph.
Firmansyah Firmansyah, Abdul Mujib
doaj +2 more sources
Chromatic number via Turán number [PDF]
Discrete Mathematics, 2017 A Kneser representation KG(H) for a graph G is a bijective assignment of hyperedges of a hypergraph H to the vertices of G such that two vertices of G are adjacent if and only if the corresponding hyperedges are disjoint. In this paper, we introduce a colored version of the Turan number and use that to determine the chromatic number of some families of
Meysam Alishahi, Hossein Hajiabolhassan
openalex +3 more sources
The Locating-Chromatic Number of Origami Graphs
Algorithms, 2021 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).
Agus Irawan +3 more
doaj +2 more sources
The b-chromatic number of power graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x i adjacent to a
Brice Effantin, Hamamache Kheddouci
doaj +3 more sources
The Chromatic Number of Random Intersection Graphs
Discussiones Mathematicae Graph Theory, 2017 We study problems related to the chromatic number of a random intersection graph G (n,m, p). We introduce two new algorithms which colour G (n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of
Rybarczyk Katarzyna
doaj +2 more sources
On the Locating Chromatic Number of Barbell Shadow Path Graph
Indonesian Journal of Combinatorics, 2021 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.
A. Asmiati +2 more
doaj +3 more sources
Chromatic Number of Resultant of Fuzzy Graphs [PDF]
Fuzzy Information and Engineering, 2016 Fuzzy graph coloring techniques are used to solve many complex real world problems. The chromatic number of complement of fuzzy graph is obtained and compared with the chromatic number of the corresponding fuzzy graph.
Anjaly Kishore, M.S. Sunitha
doaj +2 more sources