Pages that link to "Item:Q1245240"
From MaRDI portal
The following pages link to On total matching numbers and total covering numbers of complementary graphs (Q1245240):
Displayed 8 items.
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- (Q3748313) (← links)
- Signed mixed dominating functions in complete bipartite graphs (Q5259070) (← links)
- Outer-paired domination in graphs (Q5859480) (← links)
- (Q6089653) (← links)