Irredundance graphs

DOI10.1016/j.dam.2022.08.005zbMath1498.05188arXiv1812.03382OpenAlexW4291794536MaRDI QIDQ2081464

Yanyan Li

Publication date: 13 October 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.03382

zbMATH Keywords

irredundancereconfiguration problemIR-graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

γ-Paired dominating graphs of lollipop, umbrella and coconut graphs

Cites Work

• Unnamed Item
• Classifying coloring graphs
• Reconfiguration of dominating sets
• The complexity of dominating set reconfiguration
• The gamma graph of a graph
• On the complexity of reconfiguration problems
• A note on \(\gamma\)-graphs
• Reconfiguration of list edge-colorings in a graph
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Connected \(k\)-dominating graphs
• The \(k\)-dominating graph
• Gamma graphs of some special classes of trees
• 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
• Irredundance trees of diameter 3
• INDUCED SUBGRAPHS OF GAMMA GRAPHS
• Finding paths between 3-colorings
• γ-graphs of graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• A note on some variations of the $\gamma$-graph

This page was built for publication: Irredundance graphs