完全图Kronecker积的一些点脆弱性参数(英文)

玛尔哈巴·霍加; 艾尔肯·吾买尔

您当前的位置：

首页 >

文章列表页 >

完全图Kronecker积的一些点脆弱性参数(英文)

更新时间：2026-01-21

- 完全图Kronecker积的一些点脆弱性参数(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 27, Issue 3, Pages: 276-279(2010)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2010
- 稿件说明：
移动端阅览
[1]玛尔哈巴·霍加,艾尔肯·吾买尔.完全图Kronecker积的一些点脆弱性参数(英文)[J].新疆大学学报(自然科学版),2010,27(03):276-279.

玛尔哈巴·霍加, 艾尔肯·吾买尔. 完全图Kronecker积的一些点脆弱性参数(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2010, 27(3): 276-279.
[1]玛尔哈巴·霍加,艾尔肯·吾买尔.完全图Kronecker积的一些点脆弱性参数(英文)[J].新疆大学学报(自然科学版),2010,27(03):276-279. DOI：

玛尔哈巴·霍加, 艾尔肯·吾买尔. 完全图Kronecker积的一些点脆弱性参数(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2010, 27(3): 276-279. DOI：

摘要

设G1和G2是两个图.G1和G2的Kronecker积G1×G2具有顶点集V(G1×G2)=V(G1)×V(G2)

边集为E(G1×G2)={(u1

v1)(u2

v2):u1u2∈E(G1)且u1u2∈E(G1)}.在本文中

我们确定了两个完全图的Kronecker积Km×Kn(n≥m≥2且n≥3)的一些点脆弱性参数.

Abstract

Let G1 and G2 be two graphs.The Kronecker product G1 ×G2 of G1 and G2 has vertex set V(G1 ×G2) = V(G1)×V(G2) and edge set E(G1 ×G2) = {(u1

v1)(u2

v2) : u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}.In this paper

we determine some vertex vulnerability parameters of the Kronecker product of complete graphs Km ×Kn for n ≥ m ≥ 2 and n ≥ 3.

关键词

Keywords

references

West D B.Introduction on Graph Theory[M].2001,second ed,Prentice-Hall,Upper Saddle River,NJ.

Jung H A.On maximal circuits in finite graphs[J].Ann Discrete Math,1978,3:129-144.

Barefoot C A,Entringer R,Swart H.Vulnerability in graphs-a comparative survey[J].J Combin Math Combin Comp,1987,1:13-22.

Barefoot C A,Entringer R,Swart H.Integrity of trees and powers of cycles[J].Congr Numer,1987,58:103-114.

Cozzens B,Wu Y.Vertex-neighbor-integrity of trees[J].Ars Combin,1996,43:169-180.

Cozzens B,Wu Y.Vertex-neighbor-integrity of powers of cycles[J].Ars Combin,1998,48:257-270.

Gambrell M J.Vertex-neighbor-integrity of magnifiers,expanders,and hyper-cubes[J].Discrete Math,2000,216:257-266.

Li Y,Zhang S,Li X.Rupture degree of graphs[J].Int J Comput Math,2005,82:793-803.

Alon N,Lubetzky E.Independent set in tensor graph powers[J].J Graph Theory,2007,54:73-87.

Bresar B,Imrich W,Klavzˇar S,et al.Hypercubes as directproducts[J].Discrete Math,2005,18:778-786.

Lammprey R H,Barnes B H.Products of graphs and applications[J].Modeling and Simulation,1974,5:1119-1123.

Ghozati S A.A finite automata approach to modeling the cross product of interconnection networks[J].Mathematical and Computer Modeling,1999,30:185-200.

Li F,Li X.Computing the rupture degrees of graphs[J].ISPAN,2004,368-373.

Zhang S,Li X,Han X.Computing the scattering number of graphs[J].Int J Comput.Math,2002,79:179-187.

Choudum S,Priya N.Tenacity of complete graph products and grids[J].Networks,1999,34:192-196.

Mamut A,Vumar E.Vertex vulnerability parameters of Kronecker products of complete graphs[J].Inf Proces Lett,2008,106:258-262.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

一些运算图的Wiener极性指数(英文)

一类正则图的边坚韧度(英文)

路和圈、圈和圈的Kronecker积图的超点连通性

Related Author

林欣

边红

买吐肉孜·买司地克

艾山江·吾素音

吕明富

吴丽芸

田应智

Related Institution

新疆师范大学数学科学学院

新疆大学数学与系统科学学院,新疆师范大学数理信息学院,新疆喀什师范学院数理系新疆乌鲁木齐830046,新疆乌鲁木齐830054

⁰