Solution of Time Dependent Joule Heat Equation for a Graphene Sheet Under Thomson Effect

We address a physics-based solution of joule heating phenomenon in a single-layer graphene (SLG) sheet under the presence of Thomson effect. We demonstrate that the temperature in an isotopically pure (containing only C-12) SLG sheet attains its saturation level quicker than when doped with its isotopes (C-13). From the solution of the joule heating equation, we find that the thermal time constant of the SLG sheet is in the order of tenths of a nanosecond for SLG dimensions of a few micrometers. These results have been formulated using the electron interactions with the inplane and flexural phonons to demonstrate a field-dependent Landauer transmission coefficient. We further develop an analytical model of the SLG specific heat using the quadratic (out of plane) phonon band structure over the room temperature. Additionally, we show that a cooling effect in the SLG sheet can be substantially enhanced with the addition of C-13. The methodologies as discussed in this paper can be put forward to analyze the graphene heat spreader theory.

Polynomial time and parameterized approximation algorithms for boxicity

The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝ k . The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split graphs, within an O(n 0.5 − ε ) factor for any ε > 0, unless NP = ZPP. We prove that if a graph G on n vertices has a clique on n − k vertices, then box(G) can be computed in time n22O(k2logk) . Using this fact, various FPT approximation algorithms for boxicity are derived. The parameter used is the vertex (or edge) edit distance of the input graph from certain graph families of bounded boxicity - like interval graphs and planar graphs. Using the same fact, we also derive an O(nloglogn√logn√) factor approximation algorithm for computing boxicity, which, to our knowledge, is the first o(n) factor approximation algorithm for the problem. We also present an FPT approximation algorithm for computing the cubicity of graphs, with vertex cover number as the parameter.