Zobrazeno 1 - 10
of 5 876
pro vyhledávání: '"chromatic number"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-5 (2024)
In this paper, we determine the game chromatic number of oriented honeycomb network graphs and oriented cube connected cycle network graphs.
Externí odkaz:
https://doaj.org/article/b693263641b34e01bd225591e7b63401
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 128-134 (2024)
Externí odkaz:
https://doaj.org/article/53ba0a947f24456d9685100c86bc5202
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 32, Iss 2, Pp 53-84 (2024)
Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ Kn, where Kn is the complete graph of order n. It is als
Externí odkaz:
https://doaj.org/article/1eb4d4ac9e2e4c60a0eadda80c9eb418
Publikováno v:
Mathematics Interdisciplinary Research, Vol 9, Iss 2, Pp 215-236 (2024)
Graph coloring is the assignment of one color to each vertex of a graph so that two adjacent vertices are not of the same color. The graph coloring problem (GCP) is a matter of combinatorial optimization, and the goal of GCP is determi
Externí odkaz:
https://doaj.org/article/d97499e25f8c442ca19b47d73f30ae2d
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 152-160 (2024)
The class of [Formula: see text]-free graphs has been well studied in the past. In the paper “On the chromatic number of [Formula: see text]-free graphs, Discrete Applied Mathematics, 253 (2019), 14–24”, it was shown that the class of [Formula:
Externí odkaz:
https://doaj.org/article/4d6b0747e39047d0a42a77fc299e0dee
Autor:
Hanna Furmańczyk, Marek Kubale
Publikováno v:
Archives of Control Sciences, Vol vol. 34, Iss No 1, Pp 211-223 (2024)
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equ
Externí odkaz:
https://doaj.org/article/11ff78603aa34800a637a171c6fea659
Autor:
Masreshaw Walle Abate, Wang Yao
Publikováno v:
Surveys in Mathematics and its Applications, Vol 19 (2024), Pp 109-126 (2024)
For an involution near ring 𝒩 and its ideal ℐ, the text introduces an involution ideal-based zero- divisor graph Γℐ*(𝒩) which is an undirected graph with vertex set { x ∈ 𝒩 - ℐ: x𝒩y ⊂ ℐ (or y𝒩x ⊂ ℑ ) for some y ∈
Externí odkaz:
https://doaj.org/article/c4a4abb3c218445e9f7fb1b1b158e38c
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 351-361 (2024)
The atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of
Externí odkaz:
https://doaj.org/article/8e301fe6351a4cb1aec2702110928ff0