Advances and Applications in Discrete Mathematics
Volume 25, Issue 1, Pages 11 - 21
(September 2020) http://dx.doi.org/10.17654/DM025010011 |
|
THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH
Surajit Kr. Nath
|
Abstract: Adjacency graph is a graph obtained from a hypergraph whose vertex set is the vertex set of that hypergraph and any two vertices are adjacent in adjacency graph if and only if they are adjacent in the hypergraph. With the help of this adjacency graph this paper established some results. Concept of bipartite in hypergraph is generalized into a general concept named n-partite and mentioned a problem in connection with the characterization of n-partite hypergraph. Two newly concepts strongly bipartite and stable set is introduced. This article introduced complement and self complement of hypergraph and established some results with the help of adjacency graph. In the last section, adjacent degree and strong chromatic number of a hypergraph is introduced and established some results from know results. |
Keywords and phrases: hypergraph, adjacency graph, adjacent degree, strong chromatic number.
|
|
Number of Downloads: 225 | Number of Views: 691 |
|