Results 51 to 60 of about 118 (93)
Matching criticality in intersecting hypergraphs
The transversal number τ(H) of a hypergraph H is the minimum cardinality of a set of vertices that intersects all edges of H. The matching number α′(H) of H is the maximum cardinality of a matching in H. A hypergraph H is intersecting if and only if α′(H)
Ni, Zhenyu, Shan, Erfang, Kang, Liying
core
Chain and threshold hypergraphs
Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively.
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Almost and quasi-Leinster groups
In this paper, we extend the parallelism between perfect numbers and Leinster groups, by introducing the new concepts of almost and quasi-Leinster groups which parallel almost and quasi-perfect numbers.
Pleşca Iulia-Cătălina +1 more
doaj +1 more source
Directed hypergraphs: A tool for researching digraphs and hypergraphs
H. Galeana-Sánchez, Martín Manrique
semanticscholar +1 more source
Representing Higher-Order Networks: A Survey of Graph-Based Frameworks
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice.
Fujita, T., Smarandache, Florentin
core
Scores, inequalities and regular hypertournaments
M. Khan, S. Pirzada, K. K. Kayibi
semanticscholar +1 more source
Graphs with disjoint dominating and paired-dominating sets
Southey Justin, Henning Michael
doaj +1 more source
Hypergraphs with large transversal number and with edge sizes at least four
Henning Michael, Löwenstein Christian
doaj +1 more source
A maximum degree theorem for diameter-2-critical graphs
Haynes Teresa +3 more
doaj +1 more source

