   Chapter 10.2, Problem 7ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Suppose that for every positive integer I, all the entries in the ith row and ith column of the adjacency matrix of a graph are 0. What can you conclude about the graph?

To determine

What can you conclude about the graph?

Explanation

Given information:

Suppose that for all positive integers i, all the entries in the ith row and ith column of the adjacency matrix of a graph are 0.

Calculation:

The adjacency matrix A = [aij] is n×n zero-one matrix with

aij={1                     if there is an edge from  v i to  v j0

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 