An Improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
For a graph <i>G</i>, its <i>k</i>-rainbow independent domination number, written as <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>γ</mi><mi>rik&...
Main Author: | Enqiang Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-02-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/4/402 |
Similar Items
-
Nordhaus-Gaddum bounds for upper total domination
by: Teresa W. Haynes, et al.
Published: (2022-06-01) -
Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues
by: Nastaran Keyvan, et al.
Published: (2018-03-01) -
图的Nordhaus-Ghaddumm型的代数连通度的界(A sharp lower bound for the algebraic connectivity of the Nordhaus- Gaddumm type)
by: LÜDa-mei,(吕大梅), et al.
Published: (2009-11-01) -
On Nordhaus-Gaddum type relations of δ-complement graphs
by: Panupong Vichitkunakorn, et al.
Published: (2023-06-01) -
Domination number of middle graphs
by: Farshad Kazemnejad, et al.
Published: (2023-06-01)