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 条
  • [31] On aesthetics for user-sketched layouts of vertex-weighted graphs
    Lin, Chun-Cheng
    Huang, Weidong
    Liu, Wan-Yu
    Chen, Chang-Yu
    JOURNAL OF VISUALIZATION, 2021, 24 (01) : 157 - 171
  • [32] Stable structure on safe set problems in vertex-weighted graphs
    Fujita, Shinya
    Park, Boram
    Sakuma, Tadashi
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
  • [33] Motion-Adaptive Transforms based on Vertex-Weighted Graphs
    Liu, Du
    Flierl, Markus
    2013 DATA COMPRESSION CONFERENCE (DCC), 2013, : 181 - 190
  • [34] Integrated Crossover Based Evolutionary Algorithm for Coloring Vertex-Weighted Graphs
    Boz, Betul
    Sungu, Gizem
    IEEE ACCESS, 2020, 8 : 126743 - 126759
  • [35] Motion-Adaptive Transforms Based on the Laplacian of Vertex-Weighted Graphs
    Liu, Du
    Flierl, Markus
    2014 DATA COMPRESSION CONFERENCE (DCC 2014), 2014, : 53 - 62
  • [36] Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
    Plaxton, C. Gregory
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 524 - 534
  • [37] On distances in vertex-weighted trees
    Cai, Qingqiong
    Cao, Fuyuan
    Li, Tao
    Wang, Hua
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 333 : 435 - 442
  • [38] Effects of Individual Difference on User-Sketched Layouts of Vertex-Weighted Graphs
    Lin, Chun-Cheng
    Huang, Weidong
    Liu, Wan-Yu
    Chen, Chang-Yu
    2020 24TH INTERNATIONAL CONFERENCE INFORMATION VISUALISATION (IV 2020), 2020, : 45 - 50
  • [39] Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs
    Klavzar, Sandi
    Manuel, Paul
    Nadjafi-Arani, M. J.
    Rajan, R. Sundara
    Grigorious, Cyriac
    Stephen, Sudeep
    COMPUTER JOURNAL, 2016, 59 (12): : 1900 - 1910
  • [40] Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs
    Zhu, Guangjun
    Wang, Hong
    Xu, Li
    Zhang, Jiaqi
    ALGEBRA COLLOQUIUM, 2021, 28 (02) : 253 - 268