@article {
author = {Zhang, Lei and Ren, Haizhen},
title = {An existence theorem of perfect matching on $k$-partite $k$-uniform hypergraphs via distance spectral radius},
journal = {Transactions on Combinatorics},
volume = {13},
number = {4},
pages = {377-385},
year = {2024},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2023.137937.2077},
abstract = {Let $n_1, n_2,\ldots,n_k$ be integers and $V_1, V_2,\ldots,V_k$ be disjoint vertex sets with $|V_i|=n_i$ for each $i= 1, 2,\ldots,k$. A $k$-partite $k$-uniform hypergraph on vertex classes $V_1, V_2,\ldots,V_k$ is defined to be the $k$-uniform hypergraph whose edge set consists of the $k$-element subsets $S$ of $V_1 \cup V_2 \cup \cdots \cup V_k$ such that $|S\cap V_i|=1$ for all $i= 1, 2,\ldots,k$. We say that it is balanced if $n_1=n_2=\cdots=n_k$. In this paper, we give a distance spectral radius condition to guarantee the existence of perfect matching in $k$-partite $k$-uniform hypergraphs, this result generalize the result of Zhang and Lin [Perfect matching and distance spectral radius in graphs and bipartite graphs, Discrete Appl. Math., 304 (2021) 315-322].},
keywords = {$k$-uniform $k$-partite hypergraphs,Distance spectral radius,perfect matching},
url = {https://toc.ui.ac.ir/article_27945.html},
eprint = {https://toc.ui.ac.ir/article_27945_1541186ba65820112fd9979a333aaf05.pdf}
}