两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）

张万平; 孟吉翔; 乔宏伟

doi:10.13568/j.cnki.651094.651316.2021.10.26.0001

您当前的位置：

首页 >

文章列表页 >

两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）

研究精粹 | 更新时间：2026-01-21

- 两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）
- 两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）
- 新疆大学学报（自然科学版中英文） 2022年39卷第1期页码：1-15
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  supported by Natural Science Foundation of Xinjiang(2020D04046)
- DOI：10.13568/j.cnki.651094.651316.2021.10.26.0001
  中图分类号： O157.5
- 纸质出版：2022
- 稿件说明：
移动端阅览
[1]张万平,孟吉翔,乔宏伟.两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）[J].新疆大学学报(自然科学版)(中英文),2022,39(01):1-15.
[1]张万平,孟吉翔,乔宏伟.两个距离相关参数临近量和远离量关于最小度和最大度的界（英文）[J].新疆大学学报(自然科学版)(中英文),2022,39(01):1-15. DOI： 10.13568/j.cnki.651094.651316.2021.10.26.0001.

DOI：10.13568/j.cnki.651094.651316.2021.10.26.0001.

摘要

临近量和偏离量分别指的是从一个顶点v到图G中其它顶点的平均距离的最小值和最大值.与维纳指标类似

临近量和偏离量也是两个距离相关的参量.维纳指标揭示的是图的全局性质

而临近量和偏离量反映的是图的局部性质.在本文中

我们给出了在无三角形图和无四圈图中

最小度、最大度以及围长条件下临近量和偏离量的上界.

Abstract

The proximity π(G) and the remoteness ρ(G) are minimum and maximum average distance from a vertex v to all other vertices in G

respectively. Similar to the Wiener index

the proximity π(G) and the remoteness ρ(G) are also two distancebased invariants. The Wiener index reveals the global-property of graphs while the proximity π(G) and the remoteness ρ(G) point out the local-property. In this paper

we give some upper bounds on the π(G) and the ρ(G) in terms of minimum degree

maximum degree and girth in a triangle-free or a C4-free graph.

关键词

Keywords

references

WIENER H. Structural determination of paraffin boiling points[J]. Journal of the American Chemical Society, 1947, 69(5):17-20.

ENTRINGER R C, JACKSON D E, SNYDER D A. Distance in graphs[J]. Czechoslovak Mathematical Journal, 1976, 26(2):283-296.

POLANSKY O E, BONCHEV D. The minimum distance number of trees[J]. Match Communications in Mathematical and in Computer Chemistry,1986, 21:341-344.

ZELINKA B. Medians and peripherians of trees[J]. Archivum Mathematicum(Brno), 1968, 4:87-95.

MA B, WU B, ZHANG W. Proximity and average eccentricity of a graph[J]. Information Processing Letters, 2012, 112(10):392-395.

WU B, ZHANG W. Average distance, radius and remoteness of a graph[J]. Ars Mathematica Contemporanea, 2014, 7(2):441-452.

AOUCHICHE M, HANSEN P. Nordhaus-Gaddum relations for proximity and remoteness in graphs[J]. Computational and Applied Mathematics,2010, 59(8):2827-2835.

AOUCHICHE M, HANSEN P. Proximity, remoteness and girth in graphs[J]. Discrete Applied Mathematics, 2017, 222(C):31-39.

SEDLAR J. Remoteness, proximity and few other distance invariants in graphs[J]. Filomat, 2013, 28(8):1425-1435.

HUA H, DAS K C. Proof of conjectures on remoteness and proximity in graphs[J]. Discrete Applied Mathematics, 2014, 171(1):72-80.

AOUCHICHE M, HANSEN P. Proximity, remoteness and distance eigenvalues of a graph[J]. Discrete Applied Mathematics, 2016, 213(1):17-25.

LIN H, DAS K C, WU B. Remoteness and distance eigenvalues of a graph[J]. Discrete Applied Mathematics, 2016, 215(C):218-224.

MOJALLAL S A, HANSEN P. A relation between proximity and the third largest distance eigenvalue of a graph[J]. Discrete Applied Mathematics,2021, 293:50-58.

JIA H, SONG H. Remoteness and distance, distance(signless)Laplacian eigenvalues of a graph[J]. Journal of Inequalities and Applications, 2018,2018(1):58-69.

AI J, GERKE S, GUTIN G, et al. Proximity and remoteness in directed and undirected graphs[J]. Discrete Mathematics, 2021, 344(3):112252.

PEI L, PAN X, WANG K, et al. Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity[J]. Discrete Applied Mathematics, 2021, 289:292-301.

ZANG J H, MENG J X. Restricted arc-connectivity of generalized De Bruijn digraphs and Kautz digraphs[J]. Journal of Xinjiang University(Natural Science Edition in Chinese and English), 2020, 37(4):415-427.

SUN G X, MENG J X. Vertex fault tolerance of G(G0, G1; M)networks with respect to maximally connectivity[J]. Journal of Xinjiang University(Natural Science Edition), 2018, 35(3):284-288.

ZHU H Z, MENG J X. Cyclic edge-connectivity and cyclic arc-connectivity of graphs[J]. Journal of Xinjiang University(Natural Science Edition in Chinese and English), 2021, 38(6):655-664.

QIN D J, TIAN Y Z, MENG J X. Cyclic vertex connectivity of cartesian product cycles[J]. Journal of Xinjiang University(Natural Science Edition),2017, 34(4):415-420.

TIAN Y Z, MENG J X, CHEN X. On restricted edge-connectivity of half-transitive multigraphs[J]. Journal of Xinjiang University(Natural Science Edition), 2018, 35(1):34-41.

AOUCHICHE M, HANSEN P. Proximity and remoteness in graphs:results and conjectures[J]. Networks, 2011, 58(2):95-102.

DANKELMANN P. Proximity,remoteness and minimum degree[J]. Discrete Applied Mathematics, 2015, 184(C):223-228.

DANKELMANN P, ENTRINGER R C. Average distance, minimum degree, and spanning trees[J]. Journal of Graph Theory, 2000, 33(1):1-13.

ERD¨OS P, PACH J, POLLACK R, et al. Radius, diameter, and minimum degree[J]. Journal of Combinatorial Theory(Series B), 1989, 47(1):73-79.

TUTTE W T. A family of cubical graphs[J]. Mathematical Proceedings of the Cambridge Philosophical Society, 1947, 43(4):456-474.

浏览量

134

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

给定围长的图的超三限制性连通度的充分条件(英文)

图G的周长与围长

给定点数,最小度和条件直径的图的边数的上界