Results 31 to 40 of about 20,911 (165)
0034 | 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. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and
openaire +1 more source
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 +2 more sources
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
Selecciones Matemáticas, 2019 In this paper, we determine list-chromatic number and characterize chromatically unique of the graph G = Kr2+k.
Le Xuan Hung
doaj +1 more source
Chromatic numbers and products
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dwight Duffus, Norbert W. Sauer
openaire +2 more sources
Local total anti-magic chromatic number of graphs
Heliyon, 2023 Let G=(V,E) be a graph without isolated vertices and let |V(G)|=n and |E(G)|=m. A bijection π:V(G)∪E(G)→{1,2,....,n+m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u)≠ω(v), where u and
V. Sandhiya, M. Nalliah
doaj +1 more source
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
On chromatic number and minimum cut [PDF]
Journal of Combinatorial Theory, Series B, 2019 For a graph $G$, the tree graph ${\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of edges between parts of a partition of vertex set of $G$ into two parts such that each part has size at least $r$.
Meysam Alishahi, Hossein Hajiabolhassan
openaire +2 more sources
Weighted graphs: Eigenvalues and chromatic number
Electronic Journal of Graph Theory and Applications, 2016 We revisit Hoffman relation involving chromatic number $\chi$ and eigenvalues. We construct some graphs and weighted graphs such that the largest and smallest eigenvalues $\lambda$ dan $\mu$ satisfy $\lambda=(1-\chi)\mu.$ We study in particular the ...
Charles Delorme
doaj +1 more source
The Locating Chromatic Number of Book Graph
Journal of Mathematics, 2021 Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah +2 more
doaj +1 more source
On the total chromatic edge stability number and the total chromatic subdivision number of graphs [PDF]
Discrete Mathematics Letters, 2022 Arnfried Kemnitz, Massimiliano Marangio
doaj +1 more source