TY - JOUR
T1 - Chain and threshold hypergraphs
AU - Shetty, Shashwath S.
AU - Bhat K, Arathi
N1 - Publisher Copyright:
© 2025 The Author(s). Published with license by Taylor & Francis Group, LLC.
PY - 2025
Y1 - 2025
N2 - Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively. Several attempts to generalize the concept of threshold graphs to hypergraphs have been carried out. Here we make an attempt to extend the notion of chain graphs to chain hypergraphs and from threshold graphs to threshold hypergraphs. We have characterized the newly defined uniform chain and threshold hypergraphs and have given the simple steps to generate these hypergraphs corresponding to a given binary sequence.
AB - Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively. Several attempts to generalize the concept of threshold graphs to hypergraphs have been carried out. Here we make an attempt to extend the notion of chain graphs to chain hypergraphs and from threshold graphs to threshold hypergraphs. We have characterized the newly defined uniform chain and threshold hypergraphs and have given the simple steps to generate these hypergraphs corresponding to a given binary sequence.
UR - https://www.scopus.com/pages/publications/105012727235
UR - https://www.scopus.com/pages/publications/105012727235#tab=citedBy
U2 - 10.1080/09728600.2025.2538497
DO - 10.1080/09728600.2025.2538497
M3 - Article
AN - SCOPUS:105012727235
SN - 0972-8600
JO - AKCE International Journal of Graphs and Combinatorics
JF - AKCE International Journal of Graphs and Combinatorics
ER -