0
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.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
What is directed multigraph?
multigraph is graph it is connect multi edge
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 is the automorphism group of a complete bipartite graph?
The automorphism group of a complete bipartite graph K_n,n is (S_n x S_n) semidirect Z_2.
What degree of a vertex would lead to a vertex edge graph unable to be traveled?
2
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...
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 edge-connectivity?
Acronym for Enhanced Data GSM Environment. EDGE is a faster version of GSM wireless service. EDGE enables ddata to be delivered at rates up to 384 Kbps on a broadband
What is directed multigraph?
multigraph is graph it is connect multi edge
What is a negative cycle in Graph?
In a weighed graph, a negative cycle is a cycle whose sum of edge weights is negative
How do you complete a circle graph?
you fill it in
Could you Give an example of a simple 2 edge connected 3 regular planar graph?
-1
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 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.
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.
How many triangles are there in a complete graph?
The number of triangles in a complete graph with n nodes is n*(n-1)*(n-2) / 6.
