Domination-related parameters in rooted product graphs
From MaRDI portal
Publication:5964910
DOI10.1007/s40840-015-0182-5zbMath1333.05224arXiv1204.0644OpenAlexW2592437091MaRDI QIDQ5964910
Ismael González Yero, Magdalena Lemańska, Dorota Kuziak
Publication date: 2 March 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.0644
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
Roman domination in direct product graphs and rooted product graphs ⋮ Relating the super domination and 2-domination numbers in cactus graphs ⋮ The total co-independent domination number of some graph operations ⋮ On disjoint maximum and maximal independent sets in graphs and inverse independence number ⋮ Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Unnamed Item ⋮ On the independence transversal total domination number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring, location and domination of corona graphs
- On the roman domination in the lexicographic product of graphs
- A labeling algorithm for distance domination on block graphs
- Dominating direct products of graphs
- Super dominating sets in graphs
- On weakly connected domination in graphs
- Roman domination in graphs.
- On a Vizing-like conjecture for direct product graphs
- The relationships between Wiener index, stability number and clique number of composite graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- A new graph product and its spectrum
- A note on domination parameters of the conjunction of two special graphs
- Roman domination in Cartesian product graphs and strong product graphs
- Total Domination in Categorical Products of Graphs
- Some results on total domination in direct products of graphs
- Smallest independent dominating sets in Kronecker products of cycles
This page was built for publication: Domination-related parameters in rooted product graphs