Upper bounds for domination related parameters in graphs on surfaces
From MaRDI portal
Publication:334124
DOI10.1016/j.akcej.2016.06.007zbMath1348.05155arXiv1310.1610OpenAlexW1761046967MaRDI QIDQ334124
Publication date: 31 October 2016
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.1610
Euler characteristicnonorientable genusorientable genusRoman bondage numbertotal connected domination numbertotal restrained bondage numberweakly connected domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Describing 3-paths in normal plane maps
- On the Roman bondage number of planar graphs
- Restrained bondage in graphs
- On computing a conditional edge-connectivity of a graph
- A bound on the size of a graph with given order and bondage number
- On weakly connected domination in graphs
- Relating the size of a connected graph to its total and restricted domination numbers
- On the number of edges in graphs with a given weakly connected domination number
- On bondage numbers of graphs: a survey with some comments
- On the number of edges in graphs with a given connected domination number
- A note on the Roman bondage number of planar graphs
- Total restrained bondage in graphs
- Note on the bondage number of graphs on topological surfaces
- A Characterization in of Upper-Embeddable Graphs
- Generalized Embedding Schemes
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces
