**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**5

# spanning tree Related Publications

##### 5 Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues

**Authors:**
Ayse Dilek Maden

**Abstract:**

For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.

**Keywords:**
spanning tree,
degree Kirchhoff index,
normalized Laplacian
eigenvalue

##### 4 Applying Spanning Tree Graph Theory for Automatic Database Normalization

**Authors:**
Chetneti Srisa-An

**Abstract:**

In Knowledge and Data Engineering field, relational database is the best repository to store data in a real world. It has been using around the world more than eight decades. Normalization is the most important process for the analysis and design of relational databases. It aims at creating a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct insertion, deletion, and modification. Normalization is a major task in the design of relational databases. Despite its importance, very few algorithms have been developed to be used in the design of commercial automatic normalization tools. It is also rare technique to do it automatically rather manually. Moreover, for a large and complex database as of now, it make even harder to do it manually. This paper presents a new complete automated relational database normalization method. It produces the directed graph and spanning tree, first. It then proceeds with generating the 2NF, 3NF and also BCNF normal forms. The benefit of this new algorithm is that it can cope with a large set of complex function dependencies.

**Keywords:**
relational database,
functional dependency,
automatic normalization,
primary key,
spanning tree

##### 3 N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs

**Authors:**
R. Anitha,
R. S. Lekshmi

**Abstract:**

**Keywords:**
Decomposition,
spanning tree,
Hamilton cycle,
n-sun graph,
perfect matching

##### 2 Geometric Data Structures and Their Selected Applications

**Authors:**
Miloš Šeda

**Abstract:**

**Keywords:**
Motion Planning,
delaunay triangulation,
spanning tree,
Voronoi diagram,
Steiner Tree

##### 1 N-Sun Decomposition of Complete Graphs and Complete Bipartite Graphs

**Authors:**
R. Anitha,
R. S. Lekshmi

**Abstract:**

**Keywords:**
spanning tree,
Hamilton cycle,
n-sun decomposition,
perfectmatching