On the skewness of the join of graphs

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.

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2013-11, Vol.161 (16-17), p.2405-2409
Main Authors: Chia, Gek L., Sim, Kai An
Format: Article
Language:English
Subjects:
Complete multipartite graph
Deletion
Graphs
Join of graphs
Mathematical analysis
Skewness
Skewness of graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.03.023