Invariants of Bipartite Kneser B type-\MakeLowercase{k} graphs
Jayakumar C, Sreekumar K.G., Manilal K., Ismail Naci Cangul

TL;DR
This paper investigates the invariants of bipartite Kneser B type-k graphs, a class of bipartite graphs constructed from specific subset relations, providing new insights into their structural properties.
Contribution
The paper introduces the bipartite Kneser B type-k graphs and computes various graph invariants, expanding understanding of their combinatorial and structural characteristics.
Findings
Calculated key graph invariants of $H_B(n,k)$
Established structural properties of bipartite Kneser B graphs
Provided formulas for invariants based on parameters n and k
Abstract
Let where is fixed, , and . Let be the set of all non-empty subsets of such that where . Let . For a fixed , let be the set of -element subsets of , . . For any , let . Define a bipartite graph with parts and and having adjacency as is adjacent to if and only if or . A graph of this type is called a bipartite Kneser B type- graph and denoted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems
