The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(k) − E). In this paper we define a bi-regular...
Main Authors: | Kamble Lata N., Deshpande Charusheela M., Bam Bhagyashree Y. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1862 |
Similar Items
-
Almost Self-Complementary 3-Uniform Hypergraphs
by: Kamble Lata N., et al.
Published: (2017-02-01) -
A family of $t$-regular self-complementary $k$-hypergraphs
by: Masoud Ariannejad, et al.
Published: (2017-03-01) -
Regular Single Valued Neutrosophic Hypergraphs
by: Muhammad Aslam Malik, et al.
Published: (2016-12-01) -
-partite self-complementary and almost self-complementary -uniform hypergraphs
by: L.N. Kamble, et al.
Published: (2020-01-01) -
Subdivision of hypergraphs and their colorings
by: Moharram N. Iradmusa
Published: (2020-03-01)