0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is directed multigraph?
multigraph is graph it is connect multi edge
What is the edge connectivity of a complete graph?
can't help about the edge connectivity but a graph is an animal you can see at the zoo - they stand out because they have very long necks and are generally decorated with brown oblongs.
What is a cycle graph?
A cycle is a closed path such that the end vertex of the final edge is the start vertex of the first edge.
What is cyclomatic number of a graph is called?
cyclomatic number of a graph is e.n+1 where e is number of edge of graph and n is number of node in graoh g
What degree of a vertex would lead to a vertex edge graph unable to be traveled?
2
Difference between a directed graph and an undirected graph in a computer program?
In an undirected graph, an edge is an unordered pair of vertices. In a directed graph, an edge is an ordered pair of vertices. The ordering of the vertices implies a direction to the edge, that is that it is traversable in one direction only.
What is the bottom edge of a line graph?
The x-axis
What is directed multigraph?
multigraph is graph it is connect multi edge
What is the edge connectivity of a complete graph?
can't help about the edge connectivity but a graph is an animal you can see at the zoo - they stand out because they have very long necks and are generally decorated with brown oblongs.
What is a negative cycle in Graph?
In a weighed graph, a negative cycle is a cycle whose sum of edge weights is negative
What is a cycle graph?
A cycle is a closed path such that the end vertex of the final edge is the start vertex of the first edge.
What is cyclomatic number of a graph is called?
cyclomatic number of a graph is e.n+1 where e is number of edge of graph and n is number of node in graoh g
How do you find subgraph in a graph?
simply draw separate graph from the graph from which you have to find the subgraphs, remove exact one edge ont time and proceed to the till end.
What is the difference between resource allocation graph and wait for graph?
In Wait for Graph the request edge is a directed edge Pi → Pj which indicates that process Pj is holding a resource that process Pi needs and thus Pi is waiting for Pj to release its lock on that resource. It does not have any allocation edge.In case of Resource Allocation Graph the request edge is a directed edge Pi → Rj which indicates that process Pi is requesting resource Rj. It has an allocation edge from Rj→Pk when the resource Rj is allocated to process Pk.The way the graphs are drawn are also different but both of them are used in deadlock detection.
Is a sign graph a function?
A function must have a value for any given domain. For each edge (or interval), the sign graph has a sign (+ or -) . So, it is a function.
If the edge isn't included in the graph of an inequality you should draw what kind of line?
dashed
What degree of a vertex would lead to a vertex edge graph unable to be traveled?
2
