Results 241 to 250 of about 196,247 (278)
On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor [PDF]
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 ...
Stéphane Marchand-Maillet
exaly +6 more sources
Adjacency preserving maps between tensor spaces
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wai Leong Chooi
exaly +5 more sources
The cyclic index of adjacency tensor of generalized power hypergraphs [PDF]
Let $G$ be a $t$-uniform hypergraph, and let $c(G)$ denote the cyclic index of the adjacency tensor of $G$. Let $m,s,t$ be positive integers such that $t \ge 2$, $s \ge 2$ and $m=st$. The generalized power $G^{m,s}$ of $G$ is obtained from $G$ by blowing up each vertex into an $s$-set and preserving the adjacency relation. It was conjectured that $c(G^{
Yi-Zheng Fan
exaly +5 more sources
On Spectral Hypergraph Theory of the Adjacency Tensor [PDF]
We study both $H$ and $E/Z$-eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive $H$ or $Z$-eigenvalue corresponds to a strictly positive eigenvector. We also investigate when the $E$-spectrum of the adjacency tensor is symmetric.
Tan Zhang
exaly +5 more sources
Some of the next articles are maybe not open access.
Sub-hypergraph matching based on adjacency tensor
Computer Vision and Image Understanding, 2019Abstract Point correspondence problem is an important problem in pattern recognition and computer vision, which can be solved by graph matching. Recently, high order graph matching methods have attracted much attention due to their robustness to geometric transformations.
Xu Yang, Zhiyong Liu, Zhang-Bing Zhou
exaly +2 more sources
On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
An Chang
exaly +3 more sources
Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices [PDF]
arXiv admin note: substantial text overlap with arXiv:1902 ...
Fan, Yizheng, Zhu, Zhu, Wang, Yi
exaly +4 more sources
Permeability tensor for a metamaterial adjacent to a metal
Applied Physics A, 2016In our work, we investigate magnetic properties of metamaterial–metal interface with the help of the local field theory combined with the method of images. Proceeding from microscopic description of the substance and calculating its macroscopic properties, for the first time the modified Clausius–Mossotti relation has been obtained for permeability of ...
Olga V. Porvatkina +2 more
openaire +1 more source
Adjacency preserving maps on symmetric tensors
Linear Algebra and Its ApplicationsLet \(\mathfrak S^r(U)\) denote the vector space of all \(r\)-symmetric tensors of a vector space \(U\) over a field \(F\). The \textit{symmetric rank} of an element \(A \in \mathfrak S^r(U)\), denoted by \(\text{rank}_S(A)\), is the minimal positive integer for which \(A\) may be expressed as a linear combination of symmetric tensors of the form \(u ...
Wai Leong Chooi
exaly +3 more sources
Scalable Tensor Methods for Nonuniform Hypergraphs
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to
Stephen Young, Ilya Amburg
exaly +1 more source

