New results about the bondage number of a graph

From MaRDI portal
Publication:1363706

DOI10.1016/S0012-365X(96)00007-6zbMath0881.05067MaRDI QIDQ1363706

Ulrich Teschner

Publication date: 8 September 1997

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




Related Items (31)

Edge criticality in graph dominationTotal restrained bondage in graphsEternal \(m\)-security bondage numbers in graphsBondage number of the strong product of two treesThe bondage numbers of graphs with small crossing numbersConstruction for trees without domination critical verticesThe \(k\)-rainbow bondage number of a graphThe bondage number of generalized Petersen graphs \(P(n,2)\)On construction for trees making the equality hold in Vizing's conjectureOn the average lower bondage number of graphs under join and corona operationsRelations between edge removing and edge subdivision concerning domination number of a graphBondage number of strong product of two pathsOn the average lower bondage number of a graphNon-isolating 2-bondage in graphsOn bondage numbers of graphs: a survey with some commentsBondage number of grid graphsThe \(p\)-bondage number of treesOn the Roman bondage number of planar graphsUpper bounds on the bondage number of the strong product of a graph and a treeThe bondage numbers of extended de Bruijn and Kautz digraphsBondage number of mesh networksSome progress on total bondage in graphsOn the bondage number of planar and directed graphsThe total bondage number of grid graphsNon-isolating bondage in graphsBondage numbers of Mycielski graphsRestrained bondage in graphsOn the double bondage number of graphs productsChanging and unchanging of the domination number of a graphOn the complexity of multiple bondage in graphs2-bondage in graphs



Cites Work


This page was built for publication: New results about the bondage number of a graph