Results 71 to 80 of about 728,495 (209)
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
The Algebra of Signatures for Extreme Two-Uniform Hypergraphs
Axioms, 2023 In the last decade, several characterizations have been constructed for constructions such as extreme hypergraphs. One of the most recently described features is the signature. A signature is a number that uniquely describes an extremal and allows one to
Evgeniya Egorova +2 more
doaj +1 more source
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
Axioms, 2021 The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang +3 more
doaj +1 more source
Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, Volume 113, Issue 4, Page 634-649, December 2026.ABSTRACT Let n , k be positive integers such that n ≥ k and G be a tripartite graph with parts A , B , C such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n. Denote the edge densities of G [ A , B ] , G [ A , C ] and G [ B , C ] by α , β and γ, respectively. In this paper, we study edge density conditions for the existence of k vertex‐disjoint triangles in a ...
Mingyang Guo, Klas Markström
wiley +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Transversals and domination in uniform hypergraphs
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csilla Bujtás +2 more
openaire +3 more sources
Constrained Colouring and σ-Hypergraphs
Discussiones Mathematicae Graph Theory, 2015 A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Global Graph Surrogates and Neural Graph Elements for Computational Mechanics
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Machine learning surrogates are increasingly used to accelerate physics‐based simulations by predicting full‐field responses at a fraction of the computational cost. In this contribution, we present two complementary graph‐based approaches for surrogate modelling in computational mechanics.
Rutwik Gulakala, Marcus Stoffel
wiley +1 more source
Intersection Graphs of k-Uniform Hypergraphs
, 1980 Some recent result of authors and others on characterizations of intersection graphs of κ-uniform hypergraphs are ...
Singhi, N. M. +7 more
core +1 more source