An analytical approach to determine conventional S−N curves from accelerated-fatigue data

This paper describes an analytical method of obtaining conventional S?N curves from the accelerated-fatigue tests, namely the generalized Prot accelerated-fatigue-testing technique in which the stress amplitude increases linearly with respect to cycle. Miner's cumulative-damage theory was applied and an expression for the sum of a series of natural numbers raised to a certain nonintegral power was developed to achieve this. The agreement between analytical prediction and experimental verification is quite reasonable.     

Acyclic edge coloring of 2‐degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). A graph is called 2‐degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2‐degenerate graphs properly contains series–parallel graphs, outerplanar graphs, non ? regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a′(G)?Δ + 2, where Δ = Δ(G) denotes the maximum degree of the graph. We prove the conjecture for 2‐degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2‐degenerate graph with maximum degree Δ, then a′(G)?Δ + 1. © 2010 Wiley Periodicals, Inc. J Graph Theory 69: 1–27, 2012     

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a^′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.     

Acyclic edge coloring of graphs with maximum degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a′(G)?Δ + 2, where Δ=Δ(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Δ(G)?4, with the additional restriction that m?2n?1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m?2n, when Δ(G)?4. It follows that for any graph G if Δ(G)?4, then a′(G)?7. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 192–209, 2009     

Elastic scattering of electrons by benzene

Relative differential cross-sections for the elastic scattering of electrons from benzene have been measured at incident energies 300, 500, 700 and 900eV and for scattering angles between 30° and 120°. The results are discussed and compared with the independent atom model (IAM) calculations. Two different sets of scattering amplitudes for the constituent atoms of benzene were used in these calculations, one obtained from first Born approximation and the other from partial wave analysis of the Dirac equation. Only the static interaction was taken into account in the calculations. The higher the incident energy, the better is the observed agreement between experiment and theory. This indicates that at higher energies, absorption, exchange and polarization effects are not significant as compared to the static interaction and that the IAM satisfactorily predicts the interference of scattering from the individual atoms of C₆H₆.     

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) ≤ 2r(G) + c, where r(G) denotes the radius of G and \({c \in \{0, 1, 2\}}\) . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius [1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time \({(2 + \frac{2}{r(G)})}\) -factor approximation algorithms.     

Selective solar photocatalytic oxidation of ethylbenzene on C,N, and S doped TiO<Subscript>2</Subscript>

The liquid-phase photo-oxidation of ethylbenzene (EB) is investigated in solar light with air/O₂/N₂ at atmospheric pressure, in a batch reactor using acetonitrile medium. It is carried out over TiO₂ doped with C, N, and S (TCNS) photocatalyst samples. The photocatalytic oxidation yielded acetophenone (33%) and 1-phenylethanol (21%) at 56% conversion of EB during a 6-h irradiation time. This product distribution indicates that C–H bond activation has occurred only at the alkyl chain. The effects of the EB to water content ratio, amount of photocatalyst and its sustainability, pH, have been studied. It is illustrated that the reaction carried out by this environmentally friendly photocatalysis is truly heterogeneous under mild conditions using solar light and no waste generation. An optimum loading of TCNS5 was observed for the photo-oxidation of EB.