arXiv:2011.01763 [math.CO]AbstractReferencesReviewsResources
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
Published 2020-11-03Version 1
For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$. An open question in $\gamma$-graphs is whether every bipartite graph is the $\gamma$-graph of some bipartite graph. We answer this question in the negative by demonstrating that $K_{2, 3}$ is not the $\gamma$-graph of any bipartite graph.
Related articles: Most relevant | Search more
arXiv:1905.03758 [math.CO] (Published 2019-05-09)
Super-pancyclic hypergraphs and bipartite graphs
arXiv:1707.01633 [math.CO] (Published 2017-07-06)
On a Generalization of the Bipartite Graph $D(k,q)$
arXiv:2009.06688 [math.CO] (Published 2020-09-14)
On the number of spanning trees in bipartite graphs