Factorisation and Labeling in Hypergraphs

C.S Harisha, Et Al

doi:10.17762/turcomat.v12i5.2036

Abstract

Graphs have lots of applications in various domains. They support only pair wise relationships. Hypergraphs does more than graphs. In graph theory, a graph where an edge can join any number of vertices is called as the hyper graph. The corresponding edges are called as hyper edges. The integers used for assignment of labels to the edges and vertices or to only vertices of a graph or to only the edges is called as the graph labeling in this paper we study about factorization and labeling in hyper graphs with the hyper graphs obtained from graphs.

Highlights

Graphs have applications both in theory and practice
Hyper graphs become a natural modeling of collaboration networks and various other situations as they preserve the multi-adic relationships. They are useful in modeling but the limitations of using hyper graphs was discussed by Xavier Onrard
Bichitra Kalita has discussed about different types of factorization in complete graphs of some particular forms

Summary

Introduction

Graphs have applications both in theory and practice. Graphs are discrete objects used to describe pair wise relation between the objects. A well known generalization of graphs commonly called as Hyper graphs was introduced in the 1960s [3] They are known to have numerous applications in several fields of computer science, machine learning, game theory, indexing of databases, SAT problem, data mining, and optimization. Hyper graphs become a natural modeling of collaboration networks and various other situations as they preserve the multi-adic relationships They are useful in modeling but the limitations of using hyper graphs was discussed by Xavier Onrard. Bichitra Kalita has discussed about different types of factorization in complete graphs of some particular forms. He developed the algorithm for the solution of TSP. Labeling (or valuation) of a graph is a map that carries graph elements (vertices and edges) to numbers (usually positive integers). The author is motivated to study about factorization and labeling with the work done by different authors on graph factorization and graph labeling. [4]

Preliminaries and New Definitions

Results

Labeling in Special Hyper Graphs and its Sub Graphs