Abstract
In this paper, we show that each of the adjacency tensor, the Laplacian tensor and the signless Laplacian tensor of a uniform directed hypergraph has n linearly independent H-eigenvectors. Some lower and upper bounds for the largest and smallest adjacency, Laplacian and signless Laplacian H-eigenvalues of a uniform directed hypergraph are given. For a uniform directed hypergraph, the smallest Laplacian H-eigenvalue is 0. On the other hand, the upper bound of the largest adjacency and signless Laplacian H-eigenvalues are achieved if and only if it is a complete directed hypergraph. For a uniform directed hyperstar, all adjacency H-eigenvalues are 0. At the same time, we make some conjectures about the nonnegativity of one H-eigenvector corresponding to the largest H-eigenvalue, and raise some questions about whether the Laplacian and signless Laplacian tensors are positive semi-definite for a uniform directed hypergraph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
