The bondage number in complete \(t\)-partite digraphs

DOI10.1016/j.ipl.2009.06.002zbMath1197.05069OpenAlexW2057000917MaRDI QIDQ989552

Juan Liu, Xindong Zhang, Ji Xiang Meng

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.002

zbMATH Keywords

combinatorial problemsdominationbondage numbercomplete \(t\)-partite digraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Bondage number of strong product of two paths ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of mesh networks ⋮ The bondage number of the strong product of a complete graph with a path and a special starlike tree

Cites Work

• The bondage number of a graph
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• The bondage numbers of extended de Bruijn and Kautz digraphs
• On the bondage number of planar and directed graphs
• Unnamed Item

This page was built for publication: The bondage number in complete \(t\)-partite digraphs