On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
From MaRDI portal
Publication:6063279
DOI10.1007/s00373-023-02703-2arXiv2212.04570OpenAlexW4386069147MaRDI QIDQ6063279
Publication date: 7 November 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.04570
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconfiguration of dominating sets
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On a problem of Domke, Dunbar, Haynes, Hedetniemi, and Markus concerning the inverse domination number
- On the complexity of reconfiguration problems
- Graphs and cubes
- Isometric embedding in products of complete graphs
- Partial cubes: Structures, characterizations, and constructions
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Remarks about disjoint dominating sets
- An independent dominating set in the complement of a minimum dominating set of a tree
- Inverse domination in graphs
- Connected \(k\)-dominating graphs
- The lattice dimension of a graph
- The \(k\)-dominating graph
- Reconfiguration graphs for dominating sets
- On partial cubes, well-graded families and their duals with some applications in graphs
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- On the structure of dominating graphs
- Connectedness of the graph of vertex-colourings
- Distance-preserving subgraphs of hypercubes
- Finding paths between 3-colorings
- Reconfiguration of List Edge-Colorings in a Graph
- Metric Ternary Distributive Semi-Lattices
- Upper bounds for inverse domination in graphs
- Weakly Modular Graphs and Nonpositive Curvature
- Isometric subgraphs of Hamming graphs and d-convexity
- Stable networks and product graphs
- Total Domination in Graphs
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- On k-Total Dominating Graphs
- On the Addressing Problem for Loop Switching
- A ternary operation in distributive lattices
This page was built for publication: On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
