Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
On α-spectral theory of a directed k-uniform hypergraph
Authors: Gholam-Hasan Shirdel, Ameneh Mortezaee, Effat Golpar-Raboky
Keywords: Directed Hypergraph, Adjacency tensor, Laplacian tensor, Signless Laplacian tensor, Eigenvalue, $\alpha$-spectral theory, Odd-bipartite Hypergraph.
– 0.16 Mb
Keywords: Directed Hypergraph, Adjacency tensor, Laplacian tensor, Signless Laplacian tensor, Eigenvalue, $\alpha$-spectral theory, Odd-bipartite Hypergraph.
Abstract
In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha <1$ the convex linear combination of $\mathcal{D}$ and $\mathcal{A}$ has been defined as $\mathcal{A}_\alpha=\alpha\mathcal{D}+(1-\alpha)\mathcal{A}$, where $\mathcal{D}$ and $\mathcal{A}$ are the degree tensor and the adjacency tensor of $\mathcal{H}$, respectively. We propose some spectral properties of $\mathcal{A}_\alpha$. We also introduce power directed hypergraph and cored directed hypergraph and investigate their $\alpha$-spectral properties.Department of Mathematics, University of Qom
Qom, I. R. Iran
E-mail: , ,
Qom, I. R. Iran
E-mail: , ,
Fulltext
– 0.16 Mb
Contents
- Hospital-Scale Chest X-Ray Database Visualization Using RAWGraph Technique
- Solving transportation problems with concave cost functions using genetic algorithms
- Total k-rainbow domination subdivision number in graphs
- Chromatic Spectrum of Ks-WORM Colorings of Kn*
- On the Computational Complexity of Optimization Convex Covering Problems of Graphs
- On α-spectral theory of a directed k-uniform hypergraph
- C. Gaindric - National Prize Laureate of Moldova
