On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor

DOI10.1016/J.ENDM.2018.11.012zbMATH Open1460.05136arXiv1809.00162OpenAlexW2962989220MaRDI QIDQ1739934FDOQ1739934

Jean-Marie Le Goff, Stéphane Marchand-Maillet, X. Ouvrard

Publication date: 29 April 2019

Abstract: In graphs, the concept of adjacency is clearly defined: it is a pairwise relationship between vertices. Adjacency in hypergraphs has to integrate hyperedge multi-adicity: the concept of adjacency needs to be defined properly by introducing two new concepts: $k$-adjacency - $k$ vertices are in the same hyperedge - and e-adjacency - vertices of a given hyperedge are e-adjacent. In order to build a new e-adjacency tensor that is interpretable in terms of hypergraph uniformisation, we designed two processes: the first is a hypergraph uniformisation process (HUP) and the second is a polynomial homogeneisation process (PHP). The PHP allows the construction of the e-adjacency tensor while the HUP ensures that the PHP keeps interpretability. This tensor is symmetric and can be fully described by the number of hyperedges; its order is the range of the hypergraph, while extra dimensions allow to capture additional hypergraph structural information including the maximum level of $k$-adjacency of each hyperedge. Some results on spectral analysis are discussed.

Full work available at URL: https://arxiv.org/abs/1809.00162

Recommendations

• On Hb-graphs and their application to general hypergraph e-adjacency tensor
• On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
• Eigenvalues of the adjacency tensor on products of hypergraphs
• The Laplacian tensor of a multi-hypergraph
• On spectral hypergraph theory of the adjacency tensor

zbMATH Keywords

hypergraphuniformisatione-adjacency tensorhomogeneisation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Cites Work

• Spectra of uniform hypergraphs
• Spectra of general hypergraphs
• Hypergraph theory. An introduction
• Tensor Analysis
• On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor

Cited In (6)

• Functional analysis on hypergraphs: density and zeta functions -- applications to molecular graphs and image analysis
• On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
• Generalized Catalan numbers from hypergraphs
• Spectral theory of weighted hypergraphs via tensors
• Title not available (Why is that?)
• Zeon and idem-Clifford formulations of hypergraph problems

This page was built for publication: On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739934)