On the Co-PI and Laplacian Co-PI eigenvalues of a graph

In this paper we present an equivalent definition of Co-PI index and then determine the eigenvalues of Co-PI matrices and their Laplacians of Cartesian product graphs, including bounds on the second and third Co-PI spectral moment of a graph. The explicit formulae for the Co-PI index of Cartesian product graphs are also presented.     

Closure concept for 2-factors in claw-free graphs

We introduce a closure concept for 2-factors in claw-free graphs that generalizes the closure introduced by the first author. The 2-factor closure of a graph is uniquely determined and the closure operation turns a claw-free graph into the line graph of a graph containing no cycles of length at most 5 and no cycles of length 6 satisfying a certain condition. A graph has a 2-factor if and only if its closure has a 2-factor; however, the closure operation preserves neither the minimum number of components of a 2-factor nor the hamiltonicity or nonhamiltonicity of a graph.     

Coarse-grained atomistic simulation of dislocations

This paper presents a new methodology for coarse-grained atomistic simulation of dislocation dynamics. The methodology combines an atomistic formulation of balance equations and a modified finite element method employing rhombohedral-shaped 3D solid elements suitable for fcc crystals. With significantly less degrees of freedom than that of a fully atomistic model and without additional constitutive rules to govern dislocation activities, this new coarse-graining (CG) method is shown to be able to reproduce key phenomena of dislocation dynamics for fcc crystals, including dislocation nucleation and migration, formation of stacking faults and Lomer-Cottrell locks, and splitting of stacking faults, all comparable with fully resolved molecular dynamics simulations. Using a uniform coarse mesh, the CG method is then applied to simulate an initially dislocation-free submicron-sized thin Cu sheet. The results show that the CG simulation has captured the nucleation and migration of large number of dislocations, formation of multiple stacking fault ribbons, and the occurrence of complex dislocation phenomena such as dislocation annihilation, cutting, and passing through the stacking faults. The distinctions of this method from existing coarse-graining or multiscale methods and its potential applications and limitations are also discussed.     

Traceability of line graphs

Brualdi and Shanny [R.A. Brualdi, R.F. Shanny, Hamiltonian line graphs, J. Graph Theory 5 (1981) 307-314], Clark [L. Clark, On hamitonian line graphs, J. Graph Theory 8 (1984) 303-307] and Veldman [H.J. Veldman, On dominating and spanning circuits in graphs, Discrete Math. 124 (1994) 229-239] gave minimum degree conditions of a line graph guaranteeing the line graph to be hamiltonian. In this paper, we investigate the similar conditions guaranteeing a line graph to be traceable. In particular, we show the following result: let G be a simple graph of order n and L(G) its line graph. If n is sufficiently large and, either ; or and G is almost bridgeless, then L(G) is traceable. As a byproduct, we also show that every 2-edge-connected triangle-free simple graph with order at most 9 has a spanning trail. These results are all best possible.     

The Hamiltonian Index of a Graph

 It is proved that the hamiltonian index of a connected graph other than a path is less than its diameter which improves the results of P. A. Catlin etc. [J. Graph Theory 14 (1990) 347–364] and M. L. Sarazin [Discrete Math. 134(1994)85–91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established. Received: July 17, 1998 Final version received: September 13, 1999