Scientific article

On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor

Published inElectronic Notes in Discrete Mathematics, vol. 70, p. 71-76
Publication date2018

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.

  • Hypergraph
  • E-adjacency tensor
  • Uniformisation
  • Homogeneisation
Citation (ISO format)
OUVRARD, Xavier Eric, LE GOFF, Jean-Marie, MARCHAND-MAILLET, Stéphane. On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor. In: Electronic Notes in Discrete Mathematics, 2018, vol. 70, p. 71–76. doi: 10.1016/j.endm.2018.11.012
Main files (1)
Article (Published version)
ISSN of the journal1571-0653

Technical informations

Creation01/15/2020 4:05:00 PM
First validation01/15/2020 4:05:00 PM
Update time03/15/2023 6:47:21 PM
Status update03/15/2023 6:47:20 PM
Last indexation08/30/2023 10:06:20 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack