On the number of \(k\)-matchings in graphs

DOI10.1007/s40010-022-00771-2zbMath1515.05049arXiv2107.04322OpenAlexW3183108855MaRDI QIDQ6103532

Kinkar Chandra Das, Ali Reza Ashrafi, Ali Ghalavand

Publication date: 5 June 2023

Published in: Proceedings of the National Academy of Sciences, India. Section A. Physical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.04322

zbMATH Keywords

matchingsecond Zagreb indexreformulated Zagreb indexfirst general Zagreb index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On matching coefficients
• An introduction to matching polynomials
• On average eccentricity of graphs
• A note on the number of matchings and independent sets in trees
• Comparison and extremal results on three eccentricity-based invariants of graphs
• A forgotten topological index
• On a novel eccentricity-based invariant of a graph
• Connections between Wiener index and matchings
• Laplacian coefficients of trees
• Beyond the Zagreb indices

This page was built for publication: On the number of \(k\)-matchings in graphs