Bondage number of strong product of two paths
From MaRDI portal
Publication:893339
DOI10.1007/S11464-014-0391-5zbMATH Open1326.05116OpenAlexW2050595285MaRDI QIDQ893339FDOQ893339
Authors: Weisheng Zhao, Heping Zhang 
Publication date: 19 November 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-014-0391-5
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Handbook of product graphs
- On the complexity of the bondage and reinforcement problems
- The bondage number of a graph
- New results about the bondage number of a graph
- Associative graph products and their independence, domination and coloring numbers
- Title not available (Why is that?)
- Relations between packing and covering numbers of a tree
- Bondage number of mesh networks
- Title not available (Why is that?)
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Title not available (Why is that?)
- Bondage number of the discrete torus \(C_n\times C_4\)
- The bondage numbers of extended de Bruijn and Kautz digraphs
- Domination and bondage number of \(C_5\times C_n\).
- THE BONDAGE NUMBER OF C3×Cn
- The bondage number in complete \(t\)-partite digraphs
Cited In (4)
This page was built for publication: Bondage number of strong product of two paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893339)
