摘要: 让G表示一个简单连通图,图G的总离心率
![](https://image.hanspub.org/IMAGE/Edit_0968fdd8-e3b4-45ea-a542-cfb606504adf.jpg)
及多项式
![](https://image.hanspub.org/IMAGE/Edit_4af62d8b-829d-4b96-9518-11fd8f9337c2.jpg)
分别定义为
![](https://image.hanspub.org/IMAGE/Edit_7a746f43-245c-4a0b-acef-1a7116a7372c.jpg)
,
![](https://image.hanspub.org/IMAGE/Edit_d2c6d474-d72b-4f47-b9ad-3f623a6fea46.jpg)
,这里
![](https://image.hanspub.org/IMAGE/Edit_6fcb93b5-0ca0-49a4-b2be-a3e5a9213485.jpg)
是顶点ν在G中的离心率。在本文中,计算了在图运算下图的双覆盖图和拓展双覆盖图以及剖分图的总离心率及多项式,并给出具体的关系表达式和一些界。
Abstract:
Let G be a simple connected graph. The total eccentricity
![](https://image.hanspub.org/IMAGE/Edit_1448a599-6c38-49ab-818c-f40e6e4e5335.jpg)
and total eccentricity polynomial
![](https://image.hanspub.org/IMAGE/Edit_1c6db721-5d1f-4218-9c13-499722d1fa27.jpg)
of a graph G are defined as
![](https://image.hanspub.org/IMAGE/Edit_d1de24fb-9f58-444c-80d0-58c31a0d780f.jpg)
and
![](https://image.hanspub.org/IMAGE/Edit_7cba6c7b-cf26-4f9b-b96a-1e47d9328090.jpg)
, where
![](https://image.hanspub.org/IMAGE/Edit_ee78c1f7-03c0-43c5-8136-5645593c2844.jpg)
denotes the eccentricity of vertex ν in
G. In this paper, the total eccentricity and total eccentricity polynomial of double cover graph and extended double cover graph and subdivision graph of a given graph under the graph operations are computed and the exact expressions and some bounds are given.