Maximal matching and edge domination in complete multipartite graphs

DOI10.1080/00207160.2013.818668zbMath1302.05135OpenAlexW2122909918MaRDI QIDQ2921894

Lian-Ying Miao, Hai-Chao Wang, Wen Yao Song, Yan-Cai Zhao

Publication date: 14 October 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.818668

zbMATH Keywords

maximal matchingcomplete multipartite graphedge dominationedge total domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Signed total Roman edge domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect edge domination and efficient edge domination in graphs
• Two classes of edge domination in graphs
• Smallest maximal matchings in the graph of the d-dimensional cube
• Minimum Edge Dominating Sets
• Edge Dominating Sets in Graphs

This page was built for publication: Maximal matching and edge domination in complete multipartite graphs