Bondage numbers of Mycielski graphs
From MaRDI portal
Publication:726515
DOI10.1007/S40840-015-0116-2zbMATH Open1339.05288OpenAlexW2051512824MaRDI QIDQ726515FDOQ726515
Authors: Fu-Tao Hu, Moo Young Sohn, Jaeun Lee 
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0116-2
Recommendations
Cites Work
- Sur le coloriage des graphs
- On the corona of two graphs
- On the complexity of the bondage and reinforcement problems
- Theory and Application of Graphs
- The bondage number of a graph
- Bounds on the bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- New results about the bondage number of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Bondage number of grid graphs
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- Trees with large total domination number
- Title not available (Why is that?)
- The total bondage number of grid graphs
- Fractional dominations and fractional total dominations of graph complements
- Several parameters of generalized Mycielskians
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bondage number of planar graphs
- The bondage numbers and efficient dominations of vertex-transitive graphs
- On the bondage number of planar and directed graphs
- Title not available (Why is that?)
- Bondage number of the discrete torus \(C_n\times C_4\)
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs
- Further Results on the Mycielskian of Graphs
- Power domination in honeycomb networks
Cited In (4)
This page was built for publication: Bondage numbers of Mycielski graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726515)
