Pages that link to "Item:Q1313851"
From MaRDI portal
The following pages link to The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851):
Displaying 19 items.
- Triangulations and equality in the domination chain (Q494427) (← links)
- Towards a new framework for domination (Q651449) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the ratios between packing and domination parameters of a graph (Q1025506) (← links)
- A note on total domination (Q1065020) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- On the differences between the upper irredundance, upper domination and independence numbers of a graph (Q1301668) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On line independence, domination, irredundance and neighbourhood numbers of a graph (Q1814029) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Domination sequences. (Q2715967) (← links)
- A Characterization of the extended DII-sequence (Q2831802) (← links)
- On equality in an upper bound for domination parameters of graphs (Q3122896) (← links)
- Irredundance (Q3384112) (← links)
- The total irredundance numbers on graphs (Q3610428) (← links)
- On (<i>r,s</i>)-Fuzzy Domination in Fuzzy Graphs (Q4598038) (← links)
- Construction of Halin graph with perfect k-ary tree and its independent domination number (Q5036750) (← links)
