2018
DOI: 10.1016/j.dam.2017.12.025
|View full text |Cite
|
Sign up to set email alerts
|

On the b-chromatic number of cartesian products

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…According to Lemmas 2.1 and 2.2, A is a discrete Riesz spectral operator if and only if both K and L are invertible. In order to establish (10) and (11), let us focus on the following eigenvalue problem, where we seek for functions φ in D(A) and scalars µ ∈ C such that Aφ = µφ .…”
Section: Spectral Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…According to Lemmas 2.1 and 2.2, A is a discrete Riesz spectral operator if and only if both K and L are invertible. In order to establish (10) and (11), let us focus on the following eigenvalue problem, where we seek for functions φ in D(A) and scalars µ ∈ C such that Aφ = µφ .…”
Section: Spectral Analysismentioning
confidence: 99%
“…Therein, it is specified that for our class of systems, the spectrum determined growth assumption (SDGA) is satisfied when A is a discrete Riesz spectral operator, that is, ω 0 = s(A), where s(A) := sup s∈σ (A) Re(s) is the spectral bound of A. According to (10) and to the SDGA, it is easy to obtain (13).…”
Section: Spectral Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The hamming graphs have been investigated in the past. See for instance [6,7,11,12,16]. The p th power of a graph G denoted by G p is a graph whose vertex set V (G p ) = V (G) and edge set E(G p ) = {xy : d G (x, y) ≤ p}, where d G (x, y) denotes the distance between x and y in G.…”
Section: Introductionmentioning
confidence: 99%