Graph Operations on Clique-Width Bounded Graphs

Details Graph Operations on Clique-Width Bounded Graphs Graph Operations on Clique-Width Bounded Graphs

2007-01-29

arxiv.org/abs/cs/0701185v1

Computer Science

Data Structures and Algorithms

22 pages

Scientific paper

In this paper we survey the behavior of various graph operations on the graph parameters clique-width and NLC-width. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs. Therefor we consider the binary graph operations join, co-join, sum, difference, products, corona, substitution, and 1-sum, and the unary graph operations quotient, subgraph, edge complement, bipartite edge complement, power of graphs, switching, local complementation, edge addition, edge subdivision, vertex identification, and vertex addition.

Affiliated with

Also associated with

No associations

Rating

Graph Operations on Clique-Width Bounded Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Operations on Clique-Width Bounded Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Operations on Clique-Width Bounded Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534137