/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Free solutions & answers for Discrete Mathematics Chapter 8 - (Page 3) [step by step] | 91Ó°ÊÓ

91Ó°ÊÓ

Problem 29

Refer to the adjacency matrix \(A\) of \(K_{5}\). Let \(d_{n}\) be the common value of the diagonal elements of \(A^{n}\) and let \(a_{n}\) be the common value of the off-diagonal elements of \(A^{n}\). Show that $$d_{n+1}=4 a_{n} ; \quad a_{n+1}=d_{n}+3 a_{n} ; \quad a_{n+1}=3 a_{n}+4 a_{n-1}$$

Problem 30

Paul Erd?s \((1913-1996)\) was one of the most prolific mathematicians of all time. He was the author or co-author of nearly 1500 papers. Mathematicians who co-authored a paper with Erd?s are said to have Erd?s number one. Mathematicians who did not co-author a paper with Erd?s but who co-authored a paper with a mathematician whose Erd?s number is one are said to have Erdós number two. Higher Erd?s numbers are defined similarly. For example, the author of this book has Erd?s number five. Johnsonbaugh co-authored a paper with Tadao Murata, Murata co-authored a paper with A. T. Amin, Amin co- authored a paper with Peter J. Slater, Slater co-authored a paper with Frank Harary, and Harary co-authored a paper with Erdõs. Develop a graph model for Erd?s numbers. In your model, what is an Erd?s number?

Problem 32

Draw all nonisomorphic simple graphs having four vertices.

Problem 34

Draw all nonisomorphic, cycle-free, connected graphs having six vertices.

Problem 35

When does the complete graph \(K_{n}\) contain an Euler cycle?

Problem 36

When does the complete bipartite graph \(K_{m, n}\) contain an Euler cycle?

Problem 38

For which values of \(n\) does the \(n\) -cube contain an Euler cycle?

Problem 40

How many edges are incident on a vertex in an \(n\) -cube?

Problem 41

How many edges are in an \(n\) -cube?

Problem 41

The complement of a simple graph \(G\) is the simple graph \(\bar{G}\) with the same vertices as \(G .\) An edge exists in \(\bar{G}\) if and only if it does not exist in \(G\). Given two graphs \(G_{1}\) and \(G_{2},\) suppose that there is a one-toone, onto function \(f\) from the vertices of \(G_{1}\) to the vertices of \(G_{2}\) and a one-to-one, onto function \(g\) from the edges of \(G_{1}\) to the edges of \(G_{2},\) so that if an edge \(e\) is incident on \(v\) and \(w\) in \(G_{1},\) the edge \(g(e)\) is incident on \(f(v)\) and \(f(w)\) in \(G_{2} .\) Are \(G_{1}\) and \(G_{2}\) isomorphic?

Access millions of textbook solutions in one place

  • Access over 3 million high quality textbook solutions
  • Access our popular flashcard, quiz, mock-exam and notes features
  • Access our smart AI features to upgrade your learning
Access millions of textbook solutions in one place

Recommended explanations on Math Textbooks