Solid electrolytes based on doped cerium oxide, Ce(M)O2-δ (M = rare-earth cations), are of considerable interest for potential use in low temperature solid oxide fuel cells (LTSOFCs) due to its higher ionic conductivity than YSZ based solid electrolyte.  In this research work, crystalline, pure Ce1-xMxO2-δ (where M = Gd or Sm, x = 0.10 or 0.20) based nanoparticles were prepared by chemical prec...

The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, respectively. In addition, a way to prove the nonexistence of a finite characterization for any other class of independence models is suggested. MSC 2000: 60A99, 68T30, 94A15

The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of Centers Program in the interest of information exchange. UCF and the U.S. Government assumes no liability for the contents or use thereof.

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...