The bondage number in complete t-partite digraphs
From MaRDI portal
Publication:989552
DOI10.1016/J.IPL.2009.06.002zbMATH Open1197.05069OpenAlexW2057000917MaRDI QIDQ989552FDOQ989552
Authors: Xindong Zhang, Juan Liu, Jixiang 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
Recommendations
- The bondage number of some graphs
- On the bondage number of a graph
- Bounds on the bondage number of a graph
- scientific article; zbMATH DE number 7742879
- The disjunctive bondage number and the disjunctive total bondage number of graphs
- The bondage numbers of extended de Bruijn and Kautz digraphs
- Total bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- scientific article; zbMATH DE number 876673
- The bondage number of a graph
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (7)
- The bondage numbers of extended de Bruijn and Kautz digraphs
- On bondage numbers of graphs: a survey with some comments
- Bondage number of strong product of two paths
- Bondage number of mesh networks
- Bondage number in oriented graphs.
- The bondage number of generalized Petersen graphs \(P(n,2)\)
- The bondage number of the strong product of a complete graph with a path and a special starlike tree
This page was built for publication: The bondage number in complete \(t\)-partite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989552)
