0
Add your answer:
Earn +20 pts
What is n in Maximum number of edges in an acyclic undirected graph with n?
n-1
What is subgraph in given graph?
If all the vertices and edges of a graph A are in graph B then graph A is a sub graph of B.
What is the minimum value that the graph of y equals sinx assumes?
-1
What is the minimum y value on the graph of y sinx - 6?
It is -5.
What name is given to the turning point also known as the maximum or minimum of the graph of a quadratic function?
vertex
Is the complete graph on 5 vertices planar?
No, the complete graph of 5 vertices is non planar. because we cant make any such complete graph which draw without cross over the edges . if there exist any crossing with respect to edges then the graph is non planar.Note:- a graph which contain minimum one edge from one vertex to another is called as complete graph...
How is a Planar graph used is graph theory?
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.
The minimum number of edges in a connected cyclic graph on n vertices is?
n-1
Can a connected planar graph be drawn so that it has 5 vertices 7 regions and 10 edges?
No.No.No.No.
What is planner graph?
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.A planar graph already drawn in the plane without edge intersections is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point in 2D space, and from every edge to a plane curve, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Plane graphs can be encoded by combinatorial maps.Example of Planner graphButterfly Graph.
The minimum number of edges in a connected graph on n vertices is?
n-1 (o-o-o-o-o)
How many minimum edges in a Cyclic graph with n vertices?
The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.
Could you Give an example of a simple 2 edge connected 3 regular planar graph?
-1
What is the maximum number of edges in an acyclic undirected graph with n vertices?
n * (n - 1) / 2 That would ignore the "acyclic" part of the question. An acyclic graph with the maximum number of edges is a tree. The correct answer is n-1 edges.
What is the complexity of kruskal's minimum spanning tree algorithm on a graph with n nodes and e edges?
o(eloge)
How can you construct a dual graph?
A dual graph is constructed by taking the original graph, which must be planar (no crossing edges) and creating a vertex inside each face of the graph. A face is an enclosed area in the graph and the space outside of the graph is also a face. Once you have created a vertex in every space, you must connect every vertex by crossing each edge in the original graph. For example, a simple triangle is planar and has two faces, one inside and one outside. We would form a vertex inside the triangle and somewhere outside of the triangle. Now, we have three edges we must cross, so starting at the inner vertex, draw three lines with one exiting through exactly 1 side each. You should now have a vertex with 3 lines that exist outside of the triangle. Without crossing them, just simply connect them to the vertex on the outside. This will create a dual of the triangle. It should resemble two vertices connected with three edges. Note that this dual graph is not planar like the original.
What is krushkal algorithm?
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). Kruskal's algorithm is an example of a greedy algorithm.
