On the Number of k-Matchings in Graphs
Abstract
Suppose G is a undirected simple graph. A k-subset of edges in G without common vertices is called a k-matching and the number of such subsets is denoted by p(G,k). The aim of this paper is to present exact formulas for p(G,3), p(G,4) and P(G,5) in terms of some degree-based invariants.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.