The ρ-moments of vertex-weighted graphs

被引:0
|
作者
Chang, Caibing [1 ]
Ren, Haizhen [1 ,2 ]
Deng, Zijian [1 ]
Deng, Bo [1 ,2 ]
机构
[1] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
[2] Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Topological index; Moment; Vertex-weighted graph; Extremal problem; MEAN DISTANCE; WIENER; INDEXES;
D O I
10.1016/j.amc.2021.126070
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let (G, rho) be a vertex-weighted graph of G together with the vertex set V and a function rho(V). A rho-moment of G at a given vertex u is defined as M-G(rho)(u) = Sigma(v is an element of V) rho(v)dist(u, v), where dist(., .) stands for the distance function. The rho-moment of G is the sum of moments of all vertices in G. This parameter is closely related to degree distance, Wiener index, Schultz index etc. Motivated by earlier work of Dalfo et al. (2013), we introduce three classes of hereditary graphs by vertex(edge)-grafting operations and give the expressions for computing their rho-moments, by which we compute the rho-moments of uniform(nonuniform) cactus chains and derive the order relations of rho-moments of uniform(nonuniform) cactus chains. Based on these relations, we discuss the extremal value problems of rho-moments in biphenyl and polycyclic hydrocarbons, and extremal polyphenyl chains, extremal spiro chains etc are given, respectively. This generalizes the results of Deng (2012). (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Resistance distances in vertex-weighted complete multipartite graphs
    Chen, Wuxian
    Yan, Weigen
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 409 (409)
  • [22] Mixing time of vertex-weighted exponential random graphs
    DeMuse, Ryan
    Easlick, Terry
    Yin, Mei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2019, 362 : 443 - 459
  • [23] Tutte polynomials of vertex-weighted graphs and group cohomology
    B. S. Bychkov
    A. A. Kazakov
    D. V. Talalaev
    Theoretical and Mathematical Physics, 2021, 207 : 594 - 603
  • [24] Finding popular branchings in vertex-weighted directed graphs
    Natsui, Kei
    Takazawa, Kenjiro
    THEORETICAL COMPUTER SCIENCE, 2023, 953
  • [25] SUFFICIENT CONDITIONS FOR REALIZABILITY OF VERTEX-WEIGHTED DIRECTED GRAPHS
    SHEIN, NP
    FRISCH, IT
    IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (04): : 499 - &
  • [26] On aesthetics for user-sketched layouts of vertex-weighted graphs
    Chun-Cheng Lin
    Weidong Huang
    Wan-Yu Liu
    Chang-Yu Chen
    Journal of Visualization, 2021, 24 : 157 - 171
  • [27] A linear time algorithm for the nullity of vertex-weighted block graphs
    Singh, Ranveer
    Shaked-Monderer, Naomi
    Berman, Avi
    Discrete Applied Mathematics, 2022, 319 : 61 - 70
  • [28] A linear time algorithm for the nullity of vertex-weighted block graphs
    Singh, Ranveer
    Shaked-Monderer, Naomi
    Berman, Avi
    DISCRETE APPLIED MATHEMATICS, 2022, 319 : 61 - 70
  • [29] EIGENVALUES AND EIGENVECTORS OF CERTAIN FINITE, VERTEX-WEIGHTED, BIPARTITE GRAPHS
    RIGBY, MJ
    MALLION, RB
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (02) : 122 - 129
  • [30] VERTEX-WEIGHTED WIENER POLYNOMIALS OF SUBDIVISION-RELATED GRAPHS
    Azari, Mahdieh
    Iranmanesh, Ali
    Doslic, Tomislav
    OPUSCULA MATHEMATICA, 2016, 36 (01) : 5 - 23