On the Number of k-Matchings in Graphs

被引：1
|
作者：
Das, Kinkar Chandra [1 ]
Ghalavand, Ali [2 ]
Ashrafi, Ali Reza [1 ]
机构：
[1] Sungkyunkwan Univ, Dept Math, Suwon 16419, South Korea
[2] Univ Kashan, Fac Math Sci, Dept Pure Math, Kashan, Iran
来源：
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES | 2022年 / 92卷 / 04期
基金：
新加坡国家研究基金会;
关键词：
Matching; First general Zagreb index; Second Zagreb index; Reformulated Zagreb index; ECCENTRICITY; INDEX;
D O I：
10.1007/s40010-022-00771-2
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
In this paper, we present exact formulae for p(G, (3), p(G, (4) and p(G, (5) in terms of some degree-based invariants, where G is an 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). Significance of research work Molecular descriptors play a significant role in mathematical chemistry especially in QSPR/QSAR investigations. Among them, special place is reserved for so-called topological descriptors. Nowadays, there exists a legion of topological indices that found some applications in chemistry. In this paper, we obtain exact formulae for p(G, (3), p(G, (4) and p(G, (5) in terms of some degree-based invariants (topological indices).
引用
收藏
页码：563 / 570
页数：8
相关论文
共 50 条
  • [1] On the Number of k-Matchings in Graphs
    Kinkar Chandra Das
    Ali Ghalavand
    Ali Reza Ashrafi
    Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2022, 92 : 563 - 570
  • [2] PACKING k-MATCHINGS AND k-CRITICAL GRAPHS
    Hartvigsen, David
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 320 - 351
  • [3] On Perfect k-Matchings
    Hongliang Lu
    Wei Wang
    Graphs and Combinatorics, 2014, 30 : 229 - 235
  • [4] Spectral Conditions for Connectivity, Toughness and perfect k-Matchings of Regular Graphs
    Wenqian Zhang
    Bulletin of the Malaysian Mathematical Sciences Society, 2023, 46
  • [5] Extremal hexagonal chains concerning k-matchings and k-independent sets
    Lian-zhu Zhang
    Fu-ji Zhang
    Journal of Mathematical Chemistry, 2000, 27 : 319 - 329
  • [6] Extremal polyphenyl chains concerning k-matchings and k-independent sets
    Li, Shuhua
    Bian, Hong
    Zhang, Fuji
    Wang, Guoping
    ARS COMBINATORIA, 2010, 96 : 97 - 103
  • [7] The rainbow number of matchings in regular bipartite graphs
    Li, Xueliang
    Xu, Zhixia
    APPLIED MATHEMATICS LETTERS, 2009, 22 (10) : 1525 - 1528
  • [8] On the number of matchings of graphs formed by a graph operation
    Yan Weigen
    Yeh Yeong-Nan
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2006, 49 (10): : 1383 - 1391
  • [9] On the number of matchings of graphs formed by a graph operation
    YEH Yeong-Nan
    ScienceinChina(SeriesA:Mathematics), 2006, (10) : 1383 - 1391
  • [10] An Asymptotic Independence Theorem for the Number of Matchings in Graphs
    Teufl, Elmar
    Wagner, Stephan
    GRAPHS AND COMBINATORICS, 2009, 25 (02) : 239 - 251
12345