Tricyclic Steiner Triple Systems with 1-Rotational Subsystems (original) (raw)
Related papers
1990
This thesis involves the application of computational techniques to various problems in graph theory and low dimensional topology. The first two chapters of this thesis focus on problems in graph theory itself; in particular on graph decomposition problems. The last three chapters look at applications of graph theory to combinatorial topology, focusing on the exhaustive generation of certain families of 3-manifold triangulations. Chapter 1 shows that the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph into cycles of arbitrary specified lengths. This problem was formally posed in 1981 by Brian Alspach, but has its origins in the mid 1800s. A complete discussion of problem, as well as a full solution, is presented in Chapter 1. This work has been published, see [34].
Proceedings of the 1st annual computer science conference on Program information abstracts - CWC '73, 1973
Recent research in Graph Theory
During the last few years, my research has been in graph theory and has led to several publications and pre-publications . Firstly I will introduce the results of and .
Graph-theoretic perspective on a special class of Steiner Systems
Eprint Arxiv 1410 5855, 2014
We study S(tâ1,t,2t)S(t-1,t,2t)S(tâ1,t,2t), which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs. The constructions devised are then used to study the 222-coloring properties of these uniform hypergraphs.
IJERT-Applications On Graph Theory
International Journal of Engineering Research and Technology (IJERT), 2013
https://www.ijert.org/applications-on-graph-theory https://www.ijert.org/research/applications-on-graph-theory-IJERTV2IS1212.pdf The field of mathematics plays very important role in different fields. One of the important areas in mathematics is graph theory which is used in structural models. This structural preparations of various objects or technologies direct to new inventions and modifications in the existing environment for development in those fields. The field graph theory started its journey from the problem of Konigsberg bridge in 1735. This paper gives an overview of the applications of graph theory in various fields to some extent but mainly focuses on the computer discipline applications that uses graph theoretical concepts. A variety of papers based on graph theory have been studied related to scheduling concepts, computer science applications and an overview has been presented here.
Figure 1.3.1: Organization of our book consisting of nine chapters. The directed acyclic graph illustrates a possible teaching strategy.