0
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.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
The minimum number of edges in a connected cyclic graph on n vertices is?
n-1
How many edges are there in a graph with 7 vertices each with degree 2?
There are 7 edges.
What is the maximum number of edges in an undirected graph with V vertices?
V*(V-1)/2
Can a connected planar graph be drawn so that it has 5 vertices 7 regions and 10 edges?
No.No.No.No.
What is the time required to find shortest path in a graph with n vertices and e edges?
o(n^2)
The minimum number of edges in a connected cyclic graph on n vertices is?
n-1
The minimum number of edges in a connected graph on n vertices is?
n-1 (o-o-o-o-o)
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...
Can there be a graph with 8 vertices and 29 edges?
Yes.
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.
How many edges are there in a graph with 7 vertices each with degree 2?
There are 7 edges.
What is a drawing graph?
A drawing of a graph or network diagram is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph. In the abstract, all that matters is which pairs of vertices are connected by edges.
What is the largest number of vertices in a graph with 35 edges if all vertices are of degree at least 3?
11......
What are parallel edges?
- Two or more edges that join the same pair of vertices in a graph. Also known as multiple edges.
How can you show that every Hamiltonian cubic graph is 3-edge-colorable?
A cubic graph must have an even number of vertices. Then, a Hamilton cycle (visiting all vertices) must have an even number of vertices and also an even number of edges. Alternatively color this edges red and blue, and the remaining edges green.
What is the largest number of vertices in a graph with 35 edges if all vertices are?
36 vertices if all of them are or order two except one at each end.
Define walk path and connected graph in an algorithm?
A "walk" is a sequence of alternating vertices and edges, starting with a vertex and ending with a vertex with any number of revisiting vertices and retracing of edges. If a walk has the restriction of no repetition of vertices and no edge is retraced it is called a "path". If there is a walk to every vertex from any other vertex of the graph then it is called a "connected" graph.
