Indexed by：
Abstract：
The adjacency matrices for graphs are generalized to the adjacency tensors for uniform hypergraphs, and some fundamental properties for the adjacency tensor and its Z-eigenvalues of a uniform hypergraph are obtained. In particular, some bounds on the smallest and the largest Z-eigenvalues of the adjacency tensors for uniform hypergraphs are presented. (C) 2013 Elsevier Inc. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
LINEAR ALGEBRA AND ITS APPLICATIONS
ISSN： 0024-3795
Year： 2013
Issue： 8
Volume： 439
Page： 2195-2204
0 . 9 8 3
JCR@2013
1 . 0 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：2
CAS Journal Grade：3
Cited Count：
WoS CC Cited Count： 27
SCOPUS Cited Count： 29
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
