Common Independence in Graphs
The cardinality of a largest independent set of <i>G</i>, denoted by <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>(</mo><mi>G</mi><mo>...
Main Authors: | Magda Dettlaff, Magdalena Lemańska, Jerzy Topp |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/8/1411 |
Similar Items
-
Graphs with equal domination and independent domination numbers
by: Purnima Gupta, et al.
Published: (2020-10-01) -
Isolate and independent domination number of some classes of graphs
by: Shilpa T. Bhangale, et al.
Published: (2019-04-01) -
Domination Number, Independent Domination Number and 2-Independence Number in Trees
by: Dehgardi Nasrin, et al.
Published: (2021-02-01) -
Connected Domination Number and a New Invariant in Graphs with Independence Number Three
by: Vladimir Bercov
Published: (2021-04-01) -
Some results on the independence number of connected domination critical graphs
by: P. Kaemawichanurat, et al.
Published: (2018-08-01)