Domination on hyperbolic graphs
From MaRDI portal
Publication:2198410
DOI10.1016/j.disc.2020.112094zbMath1447.05159OpenAlexW3048930236WikidataQ115577229 ScholiaQ115577229MaRDI QIDQ2198410
José María Sigarreta-Almira, María Villeta, Rosalio Reyes, José M. Rodríguez
Publication date: 10 September 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112094
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hyperbolicity constant in graphs
- \(k\)-tuple total domination in graphs
- Dominating sets in social network graphs
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Distance domination and distance irredundance in graphs
- On the hyperbolicity constant of circular-arc graphs
- Computing the hyperbolicity constant
- A lower bound for the distance \(k\)-domination number of trees
- Lower bounds for the domination number
- An upper bound for thek-domination number of a graph
- Total domination in graphs
- A Note on "The Comparability Graph of a Tree"
- Dominating cliques in graphs