Bipartite Powers of k-chordal Graphs

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 G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, 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 G m is k - chordal, then so is G(m+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 d G (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

Calculation of Chemical Potentials and Occupancies in Clathrate Hydrates through Monte Carlo Molecular Simulations

The flexibility of the water lattice in clathrate hydrates and guest-guest interactions has been shown in previous studies to significantly affect the values of the thermodynamic properties, such as chemical potentials and free energies. Here we describe methods for computing occupancies, chemical potentials, and free energies that account for the flexibility of water lattice and guest-guest interactions in the hydrate phase. The methods are validated for a wide variety of guest molecules, such as methane, ethane, carbon dioxide, and tetrahydrodfuran by comparing the predicted occupancy values of guest molecules with those obtained from isothermal isobaric semigrand Monte Carlo simulations. The proposed methods extend the van der Waals and Platteuw theory for clathrate hydrates, and the Langmuir constant is calculated based on the structure of the empty hydrate lattice. These methods in combination with development of advanced molecular models for water and guest molecules should lead to a more thermodynamically consistent theory for clathrate hydrates.

Modified Adomian Decomposition Method for Van der Pol equations

In the paper, the well known Adomian Decomposition Method (ADM) is modified to solve the parabolic equations. The present method is quite different than the numerical method. The results are compared with the existing exact or analytical method. The already known existing Adomian Decomposition Method is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The Modified Adomian Decomposition Method results are found to converge very quickly and are more accurate compared to ADM and numerical methods. MADM is quite efficient and is practically well suited for use in these problems. Several examples are given to check the reliability of the present method. Modified Adomian Decomposition Method is a non-numerical method which can be adapted for solving parabolic equations. In the current paper, the principle of the decomposition method is described, and its advantages are shown in the form of parabolic equations. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Emergent photophenomena in three dimensional van der Waals heterostructures

We report on the fabrication and observation of emergent opto-electronic phenomena in three dimensional, micron-sized van der Waals heterostructures self-assembled from atomic layers of graphene and hexagonal boron nitride in varying ratios.