On the Number of $k-$Matchings in Graphs
Combinatorics
2021-07-12 v1
Abstract
Suppose is a undirected simple graph. A subset of edges in without common vertices is called a matching and the number of such subsets is denoted by . The aim of this paper is to present exact formulas for , and in terms of some degree-based invariants.
Cite
@article{arxiv.2107.04322,
title = {On the Number of $k-$Matchings in Graphs},
author = {Kinkar Ch. Das and Ali Ghalavand and Ali Reza Ashrafi},
journal= {arXiv preprint arXiv:2107.04322},
year = {2021}
}