On total matching numbers and total covering numbers of complementary graphs

DOI10.1016/0012-365X(77)90102-9zbMath0374.05047OpenAlexW2090663581MaRDI QIDQ1245240

A. Meir

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90102-9

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (8)

Signed mixed Roman domination numbers in graphs ⋮ Mixed Roman domination in graphs ⋮ Unnamed Item ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Unnamed Item ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Outer-paired domination in graphs ⋮ Signed mixed dominating functions in complete bipartite graphs

Cites Work

• Unnamed Item
• On total covering and matching of graphs
• Total matchings and total coverings of graphs

This page was built for publication: On total matching numbers and total covering numbers of complementary graphs