Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
question given a positive integer n generate a simple directed graph with n vertices by producing an adjacency matrix
question given a positive integer n generate a simple graph with n vertices by producing an adjacency matrix for the
question given an incidence matrix of an undirected graph list its edges and give the number of times each edge
question given the vertex pairs associated to the edges of an undirected graph and the number of times each edge
question given an adjacency matrix of a graph list the edges of this graph and give the number of times each edge
question given the vertex pairs associated to the edges of a graph construct an adjacency matrix for the graph produce
question given the ordered pairs of vertices associated to the edges of a directed graph determine the in-degree and
question for each of these properties determine whether it is monotone increasing and determine whether it is monotone
question suppose that to generate a random simple graph with n vertices we first choose a real number p with 0 le p le
question devise an algorithm for finding the shortest path between two vertices in a simple connected weighted graph
question show that if g is a simple graph with at least 11 vertices then either g or g the complement of g is
question we consider a puzzle posed by petkoviacutec in pe09 based on a problem in avch80 suppose that king arthur has
question given two chickens in a flock one of them is dominant this defines the pecking order of the flock how can a
question an orientation of an undirected simple graph is an assignment of directions to its edges such that the
question how many nonisomorphic simple connected graphs with five vertices are therea with no vertex of degree more
question show that each of these properties is an invariant that isomorphic simple graphs either both have or both do
question explain how the concept of a minimum dominating set applies to the problem of determining the minimum number
question a dominating set of vertices in a simple graph is a set of vertices such that every other vertex is adjacent
question for each of the graphs in exercise explain whether you would expect its clustering coefficient to be closer to
question explain what the clustering coefficient measures in each of these graphsa the hollywood graphb the graph of
question determine whether two given graphs are isomorphicthe complete m-partite graph kn1n2nm has vertices partitioned
question a define the chromatic number of a graphb what is the chromatic number of the graph kn when n is a positive