Hypergraph theory. An introduction
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Studies on hypergraphs. I: Hyperforests
- Inverse Perron values and connectivity of a uniform hypergraph
- Spectral properties of general hypergraphs
- Development of hypergraph theory
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
- Spectral radius of r-uniform supertrees with perfect matchings
- Bounds on the spectral radius of uniform hypergraphs
- Hypergraph modeling and visualisation of complex co-occurence networks
- On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- The matching polynomials and spectral radii of uniform supertrees
- Chaos synchronization by nonlinear coupling
- Quantum walks on hypergraphs
- Permutation symmetric hypergraph states and multipartite quantum entanglement
- Emergence and dynamics of short food supply chains
- Sufficient conditions for maximally edge-connected hypergraphs
- Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs
- Bounds on generalized FR codes using hypergraphs
- Relating hypergraph parameters of generalized power graphs
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis
- Partitions of the complete hypergraph K₆^3 and a determinant-like function
- Sparse SYK and traversable wormholes
- On the Laplacian spectrum of k-uniform hypergraphs
- Colouring simplicial complexes via the Lechuga-Murillo's model
- A fractal hypernetwork model with good controllability
- The signless Laplacian matrix of hypergraphs
- On extremal spectral radii of uniform supertrees with given independence number
- Cascading failures of \(k\) uniform hyper-network based on the hyper adjacent matrix
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata
- On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
- A homogeneous polynomial associated with general hypergraphs and its applications
- On the r-uniform linear hypertrees with extremal Estrada indices
- Zero forcing and maximum nullity for hypergraphs
- On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
- Abstract characterization of input symbol semigroups of universal hypergraphic automata
- Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
- Hypergraph characterizations of copositive tensors
- Quantum violation of the suppes-zanotti inequalities and ``contextuality
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators
- Infectious power domination of hypergraphs
- On a relationship between Cayley graphs and \(G\)-graphs with some applications
- Spectral radii of two kinds of uniform hypergraphs
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- Computational processes that appear to model human memory
- The maximum spectral radii of uniform supertrees with given degree sequences
- Reducing hypergraph coloring to clique search
- The spectral radii of intersecting uniform hypergraphs
- New results on \(k\)-independence of hypergraphs
- Applying a hypergraph to determine the structure of some finite modules
- On some general operators of hypergraphs
- Applications of hypergraphs in informatics: a survey and opportunities for research
- Introduction to graph and hypergraph theory
- The extremal spectral radii of k-uniform supertrees
- On the principal eigenvectors of uniform hypergraphs
- Maximizing spectral radii of uniform hypergraphs with few edges
- scientific article; zbMATH DE number 4010523 (Why is no real title available?)
- Hypergraph theory in wireless communication networks
- On problem of abstract characterization of universal hypergraphic automata
- scientific article; zbMATH DE number 1899813 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- The second largest spectral radii of uniform hypertrees with given size of matching
- Stability of depth functions of cover ideals of balanced hypergraphs
- Completing bases in four dimensions
- On problem of finding all maximal induced bicliques of hypergraph
- Decompositions of functions defined on finite sets in \(\mathbb{R}^d\)
- scientific article; zbMATH DE number 7527891 (Why is no real title available?)
- scientific article; zbMATH DE number 7527897 (Why is no real title available?)
- The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
- Spectra of hyperstars
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs
- Extremal problems in hypergraph colourings
- The largest spectral radius of uniform hypertrees with a given size of matching
- Fuzzy hypergraphs and related extensions
- A new entropy for hypergraphs
- On the matching polynomial of hypergraphs
- Morphological Links Between Formal Concepts and Hypergraphs
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- On P-unique hypergraphs
- scientific article; zbMATH DE number 5064049 (Why is no real title available?)
- Most-intersection of countable sets
- The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
- Mean Field Analysis of Hypergraph Contagion Models
- Noncontextual coloring of orthogonality hypergraphs
- Random recursive hypergraphs
- Enumeration of hypergraphs. I
- Application of hypergraph theory in chemistry
- Some bounds on the spectral radius of uniform hypergraphs
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
- Spectrum of the 3-zero-divisor Hypergraph of Some Classes of Local Rings
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints
- An efficient feature selection algorithm based on the description vector and hypergraph
- Existence of the map \(det^{S^3}\)
- A pipeline for testing drug mechanism of action and combination therapies: from microarray data to simulations via linear-in-flux-expressions. Testing four-drug combinations for tuberculosis treatment
- The structure and dynamics of networks with higher order interactions
- Hypergraph computation
This page was built for publication: Hypergraph theory. An introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944094)
