On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs - Details

author：

Xie, J. (Xie, J..) ^[1] | Chang, A. (Chang, A..) ^[2]

Indexed by：

Scopus

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.　©　2013　Elsevier　Inc.

Keyword：

Adjacency tensor; Bound; Hypergraph; Maximum degree; Z-eigenvalue

Community：

[ 1 ] [Xie, J.]School of Mathematics and Computer Science, Longyan University, Longyan, 364012, China
[ 2 ] [Xie, J.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, 350003, China
[ 3 ] [Chang, A.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, 350003, China

Reprint 's Address：

[Chang, A.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, 350003, China

Email：

anchang@fzu.edu.cn

Show more details

Related Keywords：

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

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

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：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to