On the skewness of the join of graphs

被引：9

作者：

Chia, Gek L. ^{[1
]}

Sim, Kai An ^{[1
]}

机构：

[1] Univ Malaya, Inst Math Sci, Kuala Lumpur 50603, Malaysia

来源：

DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 16-17期

关键词：

Join of graphs; Skewness of graph; Complete multipartite graph; GENERALIZED PETERSEN GRAPHS;

D O I：

10.1016/j.dam.2013.03.023

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The skewness of a graph G is the minimum number of edges in G whose deletion results in a planar graph. We prove some results concerning the skewness for the join of two graphs. We then use these results to determine completely the skewness of complete k-partite graphs for k = 2, 3, 4. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：2405 / 2409

页数：5