Author
Listed:
- Saifur Rahman
(Department of Mathematics, Rajiv Gandhi University, Rono Hills, Itanagar 791112, India)
- Maitrayee Chowdhury
(Department of Mathematics, Rajiv Gandhi University, Rono Hills, Itanagar 791112, India)
- Firos A.
(Department of Computer Science and Engineering, Rajiv Gandhi University, Rono Hills, Itanagar 791112, India)
- Irina Cristea
(Centre for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia)
Abstract
This paper deals with some theoretical aspects of hypergraphs related to hyperpaths and hypertrees. In ordinary graph theory, the intersecting or adjacent edges contain exactly one vertex; however, in the case of hypergraph theory, the adjacent or intersecting hyperedges may contain more than one vertex. This fact leads to the intuitive notion of knots, i.e., a collection of explicit vertices. The key idea of this manuscript lies in the introduction of the concept of the knot, which is a subset of the intersection of some intersecting hyperedges. We define knot-hyperpaths and equivalent knot-hyperpaths and study their relationships with the algebraic space continuity and the pseudo-open character of maps. Moreover, we establish a sufficient condition under which a hypergraph is a hypertree, without using the concept of the host graph.
Suggested Citation
Saifur Rahman & Maitrayee Chowdhury & Firos A. & Irina Cristea, 2022.
"Knots and Knot-Hyperpaths in Hypergraphs,"
Mathematics, MDPI, vol. 10(3), pages 1-13, January.
Handle:
RePEc:gam:jmathe:v:10:y:2022:i:3:p:424-:d:737194
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:3:p:424-:d:737194. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.