We present characterizations of connected graphs G of order n â‰¥ 2 for which h + (G) = n. It is shown that for every two integers n and m with 1 â‰¤ n âˆ’ 1 â‰¤ m â‰¤ n 2 , there exists a connected graph G ofâ€¦ (More)

We prove that if T is. any tree having n edges (n 2 1). then the n-cube Q, can be decomposed into 2"-' edge-disjoint induced subgraphs, each of which is isomorphic to T. We use this statement toâ€¦ (More)

For a nonempty graph, G, we define po(G) and ro(G) to be respectively the minimum order and minimum degree of regularity among all connected regular graphs H having a nontrivial decomposition intoâ€¦ (More)

The Pustarex experiment is designed to demonstrate the possibility of collective acceleration of highly charged heavy ions in electron rings to a few MeV/amu in an acceleration length of about 1 m.â€¦ (More)