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):
Displaying 14 items.
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- On total covers of graphs (Q1198645) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Total matchings and total coverings of threshold graphs (Q1327237) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- On ordering of complements of graphs with respect to matching numbers (Q1731077) (← links)
- Total vertex covers (Q2839639) (← links)
- (Q3748313) (← links)
- On the product of the point and line covering numbers of a graph (Q3941451) (← links)
- On the k-matchings of the complements of bicyclic graphs (Q4634518) (← links)
- Signed mixed dominating functions in complete bipartite graphs (Q5259070) (← links)
- Outer-paired domination in graphs (Q5859480) (← links)
- (Q6089653) (← links)