Results 51 to 60 of about 87 (83)
Matching criticality in intersecting hypergraphs
, 2017 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
AKCE International Journal of Graphs and CombinatoricsThreshold 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
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaIn 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
Graphs with disjoint dominating and paired-dominating sets
Open Mathematics, 2010 Southey Justin, Henning Michael
doaj +1 more source
Hypergraphs with large transversal number and with edge sizes at least four
Open Mathematics, 2012 Henning Michael, Löwenstein Christian
doaj +1 more source
A maximum degree theorem for diameter-2-critical graphs
Open Mathematics, 2014 Haynes Teresa +3 more
doaj +1 more source
Computing degree based topological indices of algebraic hypergraphs. [PDF]
HeliyonAlali AS +4 more
europepmc +1 more source