Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

For each of these properties, determine whether it is monotone increasing and determine whether it is monotone decreasing.

a) The graph G is connected.

b) The graph G is not connected.

c) The graph G has an Euler circuit.

d) The graph G has a Hamilton circuit.

e) The graph G is planar.

f) The graph G has chromatic number four.

g) The graph G has radius three.

h) The graph G has diameter three.

Short Answer

Expert verified

(a)This is monotone increasing.

(b) It is a monotone decreasing.

(c)This is not monotone increasing or monotone decreasing.

(d)It is monotone increasing.

(e)It is monotone decreasing.

(f)This is neither monotone increasing nor monotone decreasing.

(g)This is neither monotone increasing nor monotone decreasing.

(h)This is neither monotone increasing nor monotone decreasing

Step by step solution

01

(a) The graph G is connected

This property is monotone increasing since adding edges can only help in making the graph connected. It is not monotone decreasing, because by removing edges one can disconnect a connected graph.

02

(b) The graph G is not connected

It is a monotone decreasing. Since removing edges from a non-connected graph cannot possibly make it connected, while adding edges can make it possible.

03

(c) The graph G has an Euler circuit

Here, we cannot have either monotone increasing or monotone decreasing.

For example, the graph \({C_4}\), a square having an Euler circuit. In case, we have add one edge or remove one edge, then the resulting graph will not have an Euler circuit.

04

(d) The graph G has a Hamilton circuit

Here, the property is monotone increasing (because the extra edges do not interfere with the Hamilton circuit already there) but not monotone decreasing (e.g., start with a cycle).

05

(e) The graph G is planar

It is a monotone decreasing because if a graph can be drawn in plane, then each of its sub graphs can also be drawn in the plane.

However the property is not monotone increasing, let us take an example, add the missing edge to the complete graph on five vertices minus an edge to the complete graph on five vertices minus an edge changes the graph from being planar to being non planar.

06

(f) The graph G has chromatic number four

Here we have is neither monotone increasing nor monotone decreasing.

Let us take an example \({C_5}\), adding edges increases the chromatic number and removing them decreases it.

07

(g) The graph G has radius three

Here we have is neither monotone increasing nor monotone decreasing since adding edges can easily decrease the radius and removing them can easily increase it.

Take an example\({C_7}\)has radius three, but adding enough edges to make\({K_7}\)reduces the radius to 1, and removing enough edges to disconnect the graph makes the radius infinite.

08

(h) The graph G has diameter three

Here we have is neither monotone increasing nor monotone decreasing since adding edges can easily decrease the radius and removing them can easily increase it (diameter being twice the radius).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In Exercises \({\rm{3 - 5}}\)determine whether two given graphs are isomorphic.

A dominating set of vertices in a simple graph is a set of vertices such that every other vertex is adjacent to at least one vertex of this set. A dominating set with the least number of vertices is called a minimum dominating set. Find a minimum dominating set for the given graph.

Show that the chromatic number of a graph is less than or equal to\({\bf{n - i + 1}}\), where\({\bf{n}}\)is the number of vertices in the graph and\({\bf{i}}\)is the independence number of this graph.

Suppose that to generate a random simple graph with n vertices we first choose a real number p with\({\bf{0}} \le {\bf{p}} \le {\bf{1}}\). For each of the\({\bf{C}}\left( {{\bf{n,2}}} \right)\)pairs of distinct vertices we generate a random number x between 0 and 1.

If\({\bf{0}} \le {\bf{x}} \le {\bf{p}}\), we connect these two vertices with an edge; otherwise these vertices are not connected.```

a) What is the probability that a graph with m edges where\({\bf{0}} \le {\bf{m}} \le {\bf{C}}\left( {{\bf{n,2}}} \right)\)is generated?

b) What is the expected number of edges in a randomly generated graph with n vertices if each edge is included with probability p?

c) Show that if\({\bf{p = }}\frac{{\bf{1}}}{{\bf{2}}}\)then every simple graph with n vertices is equally likely to be generated.

A property retained whenever additional edges are added to a simple graph (without adding vertices) is called monotone increasing, and a property that is retained whenever edges are removed from a simple graph (without removing vertices) is called monotone decreasing.

Find the edge chromatic number of each of the graphs in

Exercises \(5 - 11\) .

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free