arXiv subjects

Xiao Zhou

Publications and source records attributed to Xiao Zhou.

153 records · Page 9Linked to original sources

arXiv2017

Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters

Let $G$ be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. For two given list colorings of $G$, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACE-complete even for bounded bandwidth graphs and a fixed constant $k$. In this paper, we study the fixed-parameter tractability of the problem when parameterized by several graph parameters. We first give a fixed-parameter algorithm for the problem when parameterized by $k$ and the modular-width of an input graph. We next give a fixed-parameter algorithm for the shortest variant when parameterized by $k$ and the size of a minimum vertex cover of an input graph. As corollaries, we show that the problem for cographs and the shortest variant for split graphs are fixed-parameter tractable even when only $k$ is taken as a parameter. On the other hand, we prove that the problem is W[1]-hard when parameterized only by the size of a minimum vertex cover of an input graph.

cs.DS↗

arXiv2017

Multi-color photometric investigation of the totally eclipsing binary NO Cam

Multi-color photometric light curves of NO Cam in $V$ $R_C$ and $I_C$ bands are obtained and analyzed simultaneously using the Wilson-Devinney (W-D) program. The solutions suggest that NO Cam is an A-subtype overcontact binary with its mass ratio to be $q = 0.439$ and a contact degree of $f = 55.5\,\%$. The small temperature difference ($ΔT = 44K$) between its two components indicates that the system is under thermal contact. The high orbital inclination ($i = 84.5^{\circ}$) strengthens our confidence in the parameters determined from the light curves. All available times of minimum light are collected and period variations are analyzed for the first time. The $O - C$ curve reveals that its period is increasing continuously at a rate of $dP/dt=+1.46\times{10^{-9}}$, which can be explained by mass transfer from the less massive component to the more massive one. After the upward parabolic variation is subtracted, the residuals suggest that there may be a cyclic variation with a period of 2.23 years and an amplitude of $A_3 = 0.00153$ days, which may due to the light-travel time effect (LTTE) arising from the gravitational influence of a close-in tertiary component. The close-in companion reveals that early dynamic interaction among triple system may have played very important role in the formation of the W UMa type binaries.

astro-ph.SR↗

arXiv2017

Physical properties and evolutionary status of the W-subtype contact binary V502 Oph with a stellar companion

Multi-color ($B$ $V$ $R_c$ $I_c$) CCD photometric light curves of the contact binary V502 Oph are analyzed using the Wilson-Devinney (W-D) program. The solutions reveal that V502 Oph is a W-subtype contact ($f = 35.3\,\%$) binary system. The temperature difference between its two components is $240K$ and the more massive star has a lower surface temperature. A cool spot is added in our model to account for the light curves' asymmetry (O'Connell effect) and third light is detected for the first time in the light curves' modeling. Combining the orbital inclination ($i = 76.4^{\circ}$) with the published mass function of V502 Oph, the absolute physical parameters of the two components are determined, which are $M_1= 0.46(\pm0.02)M_\odot, M_2=1.37(\pm0.02)M_\odot, R_1=0.94(\pm0.01)R_\odot, R_2=1.51(\pm0.01)R_\odot, L_1=1.13(\pm0.02)L_\odot$ and $L_2=2.49(\pm0.03)L_\odot$. The formation and evolutionary status of V502 Oph are discussed. All photoelectric and CCD times of light minimum about V502 Oph are gathered and its orbital period variations are analyzed. The results show that the orbital period of V502 Oph is decreasing continuously at a rate of $dP/dt=-1.69\times{10^{-7}}day\cdot year^{-1}$, which corresponds to a conservative mass transfer rate of $\frac{dM_{2}}{dt}=-3.01\times{10^{-8}}M_\odot/year$. The light-travel time effect (LTTE) is due to the presence of a close-in tertiary component with a period of $P_3=18.7$ years and an amplitute of 0.00402days. V502 Oph is an ideal target to test the formation and evolution theories of binary and multiple systems in which the light curves, $O - C$ curve and spectroscopic observations are comprehensively researched.

astro-ph.SR↗

arXiv2016

A low-mass-ratio and deep contact binary as the progenitor of the merger V1309 Sco

Nova Sco 2008 (=V1309 Sco) is an example of a V838 Mon type eruption rather than a typical classical nova. This enigmatic object was recently shown to have resulted from the merger of two stars in a contact binary. It is the first stellar merger that was identified to be undergoing a common envelope transient. To understand the properties of its binary progenitor, the pre-outburst light curves were analyzed by using the W-D method. The photometric solution of the 2002 light curve shows that it is a deep contact binary (f = 89.5(+-40.5)%) with a mass ratio of 0.094. The asymmetry of the light curve is explained by the presence of a dark spot on the more massive component. The extremely high fill-out factor suggests that the merging of the contact binary is driven by dynamical mass loss from the outer Lagrange point. However, the analysis of the 2004 light curve indicates that no solutions were obtained even at an extremely low mass ratio of q = 0.03. This suggests that the common convective envelope of the binary system disappeared and the secondary component spiraled into the envelope of the primary in 2004. Finally, the ejection of the envelope of the primary produced the outburst.

astro-ph.SR↗

arXiv2016

The Complexity of (List) Edge-Coloring Reconfiguration Problem

Let $G$ be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. Suppose that we are given two list edge-colorings $f_0$ and $f_r$ of $G$, and asked whether there exists a sequence of list edge-colorings of $G$ between $f_0$ and $f_r$ such that each list edge-coloring can be obtained from the previous one by changing a color assignment of exactly one edge. This problem is known to be PSPACE-complete for every integer $k \ge 6$ and planar graphs of maximum degree three, but any complexity hardness was unknown for the non-list variant. In this paper, we first improve the known result by proving that, for every integer $k \ge 4$, the problem remains PSPACE-complete even if an input graph is planar, bounded bandwidth, and of maximum degree three. We then give the first complexity hardness result for the non-list variant: for every integer $k \ge 5$, we prove that the non-list variant is PSPACE-complete even if an input graph is planar, of bandwidth linear in $k$, and of maximum degree $k$.

cs.DM↗

arXiv2016

The Photometric Investigation of V921 Her using the Lunar-based Ultraviolet Telescope of Chang'e-3 mission

The light curve of V921 Her in ultraviolet band observed by the Lunar-based Ultraviolet Telescope (LUT) is analyzed by the Wilson-Devinney code. Our solutions conclude that V921 Her is an early type marginal contact binary system with an additional close-in component. The binary system is under poor thermal contact with a temperature difference of nearly $700K$ between the two components. The close-in component contributes about $19\,\%$ of the total luminosity in the triple system. Combining the radial velocity study together with our photometric solutions, the mass of the primary star and secondary one are calculated to be $M_1 = 1.784(\pm0.055)M_\odot$, $M_2 = 0.403(\pm0.012)M_\odot$. The evolutionary scenario of V921 Her is discussed. All times of light minimum of V921 Her available in the bibliography are taken into account and the $O - C$ curve is analyzed for the first time. The most probable fitting results are discussed in the paper, which also confirm the existence of a third component ($P_3=10.2$ year) around the binary system. The period of V921 Her is also undergoing a continuously rapid increase at a rate of $dP/dt=+2.79\times{10^{-7}}day\cdot year^{-1}$, which may due to mass transfer from the less massive component to the more massive one.

astro-ph.SR↗

arXiv2015

Chemomechanical Origin of Hydrogen Trapping at Grain Boundaries in FCC Metals

Hydrogen embrittlement of metals is widely observed, but its atomistic origins remain little understood and much debated. Combining a unique identification of interstitial sites through polyhedral tessellation and first-principles calculations, we study hydrogen adsorption at grain boundaries in a variety of face-centered cubic metals of Ni, Cu, gamma-Fe and Pd. We discover the chemomechanical origin of variation of adsorption energetics for interstitial hydrogen at grain boundaries. A general chemomechanical formula is established to provide accurate assessments of hydrogen trapping and segregation energetics at grain boundaries, and it also offers direct explanations for certain experimental observations. The present study deepens our mechanistic understanding of the role of grain boundaries in hydrogen embrittlement, and promises a viable path towards predictive microstructure engineering against hydrogen embrittlement in structural metals.

cond-mat.mtrl-sci↗

arXiv2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs

Consider an undirected graph modeling a social network, where the vertices represent users, and the edges do connections among them. In the competitive diffusion game, each of a number of players chooses a vertex as a seed to propagate his/her opinion, and then it spreads along the edges in the graphs. The objective of every player is to maximize the number of vertices the opinion infects. In this paper, we investigate a computational problem of asking whether a pure Nash equilibrium exists in the competitive diffusion game on unweighed and weighted graphs, and present several negative and positive results. We first prove that the problem is W[1]-hard when parameterized by the number of players even for unweighted graphs. We also show that the problem is NP-hard even for series-parallel graphs with positive integer weights, and is NP-hard even for forests with arbitrary integer weights. Furthermore, we show that the problem for forest of paths with arbitrary weights is solvable in pseudo-polynomial time; and it is solvable in quadratic time if a given graph is unweighted. We also prove that the problem for chain, cochain, and threshold graphs with arbitrary integer weights is solvable in polynomial time.

cs.CC↗

arXiv2014

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs

We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it can be extended for threshold graphs. In contrast, we give a polynomial-time algorithm to solve the problem for graphs with pathwidth one. Thus, this paper gives precise analyses of the problem with respect to pathwidth.

cs.DS↗