101 research outputs found
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
Graphs and subgraphs with bounded degree
"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract.Doctor of Philosoph
Properly Colored Notions of Connectivity - A Dynamic Survey
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs
Algorithmic Graph Theory
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms for computationally difficult graph problems. The techniques studied at the workshhop included: the probabilistic method and randomized algorithms, approximation and optimization, structured families of graphs and approximation algorithms for large problems. The workshop Algorithmic Graph Theory was attended by 46 participants, many of them being young researchers. In 15 survey talks an overview of recent developments in Algorithmic Graph Theory was given. These talks were supplemented by 10 shorter talks and by two special sessions
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application
Basic Neutrosophic Algebraic Structures and their Application to Fuzzy and Neutrosophic Models
The involvement of uncertainty of varying degrees when the total of the
membership degree exceeds one or less than one, then the newer mathematical
paradigm shift, Fuzzy Theory proves appropriate. For the past two or more
decades, Fuzzy Theory has become the potent tool to study and analyze
uncertainty involved in all problems. But, many real-world problems also abound
with the concept of indeterminacy. In this book, the new, powerful tool of
neutrosophy that deals with indeterminacy is utilized. Innovative neutrosophic
models are described. The theory of neutrosophic graphs is introduced and
applied to fuzzy and neutrosophic models. This book is organized into four
chapters. In Chapter One we introduce some of the basic neutrosophic algebraic
structures essential for the further development of the other chapters. Chapter
Two recalls basic graph theory definitions and results which has interested us
and for which we give the neutrosophic analogues. In this chapter we give the
application of graphs in fuzzy models. An entire section is devoted for this
purpose. Chapter Three introduces many new neutrosophic concepts in graphs and
applies it to the case of neutrosophic cognitive maps and neutrosophic
relational maps. The last section of this chapter clearly illustrates how the
neutrosophic graphs are utilized in the neutrosophic models. The final chapter
gives some problems about neutrosophic graphs which will make one understand
this new subject.Comment: 149 pages, 130 figure
Optimizing pointer linked data structures
The thesis explores different ways of optimizing pointer linked data
structures, and especially restructuring them. The mechanisms are based
on compiler technology, theory, computer languages and hardware
architecture that are capable of optimizing the memory layout of complex
pointer linked data structures.Computer Systems, Imagery and Medi
- …