Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen Sep 1991

Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.


The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen Sep 1991

The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.


Σary, Moorhead State University, Mathematics Department May 1991

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.


On Image Information Measures And Object Extraction., Nikhil Ranjan Pal Dr. Feb 1991

On Image Information Measures And Object Extraction., Nikhil Ranjan Pal Dr.

Doctoral Theses

The field of image processing deals with the manipulation of data which are inherently two-dimensional in nature. techniques of image processing sten from two principal application The areas, namely, Improvement of pictorial information for human interpretation and processing of scene data for automatic machine perception. These areas together have experienced a vigorous growth in recent years because they have offered a number of important applications in solving scientific and engineering problems. In biological and medical sciences, we are interested in automatie analysis and interpretation of radiographs, cell images micrographs. In netallurgical, geological and and tissue environmental sciences, we are concerned …


On Separable Torsion- Free Modules Of Countable Density Character, R. Gobel, Brendan Goldsmith Jan 1991

On Separable Torsion- Free Modules Of Countable Density Character, R. Gobel, Brendan Goldsmith

Articles

The endomorphism algebras of modules of large cardinalities have been extensively studied in recent years using the combinatorial set-theoretic techniques of Shelah-the so-called black-box methods (see, e.g., [4, 5, 151). Despite the spectacular success of these methods, they are not suitable for realization theorems at small carinalities. Of course at the level of countability (or rather more generally for cardinals ~2’~) there are in some cases the original dramatic results of A. L. S. Corner [ 1, 2, 31 and the more recent generalizations of Gobel and May [ 111. Very recently the study of realization problems at cardinalities


Reductions Of Graphs And Spanning Eulerian Subgraphs, Zhi-Hong Chen Dec 1990

Reductions Of Graphs And Spanning Eulerian Subgraphs, Zhi-Hong Chen

Zhi-Hong Chen

This dissertation is primarily focused on conditions for the existence of spanning closed trails in graphs. However, results in my dissertation and the method we used, which was invented by Catlin, are not only useful for finding spanning closed trails in graphs, but also useful to study double cycle cover problems, hamiltonian line graphs problems, and dominating closed trail problems, etc. A graph is called supereulerian if it contains a spanning closed trail. Several, people have worked on the conditions for spanning closed trails having the form "d(u) + d(v) $>$ cn (0 $<$ c $<$ 1)" for all edge …