On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Counting dominating sets (DSs) in a graph is a #P-complete problem even for chordal bipartite graphs and split graphs, which are both subclasses of weakly chordal graphs. This paper investigates this problem for distance-hereditary graphs, which is another known subclass of weakly chordal graphs. This work develops linear-time algorithms for counting DSs and their two variants, total DSs and connected DSs in distance-hereditary graphs.

Download Full-text

Complexity of Hamiltonian Cycle Reconfiguration

Algorithms ◽

10.3390/a11090140 ◽

2018 ◽

Vol 11 (9) ◽

pp. 140 ◽

Cited By ~ 3

Author(s):

Asahi Takaoka

Keyword(s):

Hamiltonian Cycle ◽

Linear Time ◽

Bipartite Graphs ◽

Interval Graph ◽

Unit Interval ◽

Chordal Graphs ◽

Hamiltonian Cycles ◽

Permutation Graph ◽

Proper Subclass ◽

Chordal Bipartite Graphs

The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained from C i − 1 by a switch for each i with 1 ≤ i ≤ t , where a switch is the replacement of a pair of edges u v and w z on a Hamiltonian cycle with the edges u w and v z of G, given that u w and v z did not appear on the cycle. We show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete, settling an open question posed by Ito et al. (2011) and van den Heuvel (2013). More precisely, we show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete for chordal bipartite graphs, strongly chordal split graphs, and bipartite graphs with maximum degree 6. Bipartite permutation graphs form a proper subclass of chordal bipartite graphs, and unit interval graphs form a proper subclass of strongly chordal graphs. On the positive side, we show that, for any two Hamiltonian cycles of a bipartite permutation graph and a unit interval graph, there is a sequence of switches transforming one cycle to the other, and such a sequence can be obtained in linear time.

Download Full-text

Bipartite powers of k-chordal graphs

Discrete Mathematics & Theoretical Computer Science ◽

10.46298/dmtcs.609 ◽

2013 ◽

Vol Vol. 15 no. 2 (Graph Theory) ◽

Author(s):

Sunil Chandran ◽

Rogers Mathew

Keyword(s):

Graph Theory ◽

Positive Integer ◽

Bipartite Graph ◽

Bipartite Graphs ◽

Chordal Graphs ◽

Discrete Mathematics ◽

International Audience ◽

Positive Integers ◽

Chordal Bipartite Graphs

Graph Theory International audience Let k be an integer and k ≥3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if Gm is chordal then so is Gm+2. Brandstädt et al. in [Andreas Brandstädt, Van Bang Le, and Thomas Szymczak. Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics, 177(1-3):9-16, 1997.] showed that if Gm is k-chordal, then so is Gm+2. Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m-th bipartite power G[m] of a bipartite graph G is the bipartite graph obtained from G by adding edges (u,v) where dG(u,v) is odd and less than or equal to m. Note that G[m] = G[m+1] for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G[m], where k, m are positive integers with k≥4.

Download Full-text