Register

a graph with n vertices and n-1 edges that is not a tree is

1,121 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Anuanu asked Jun 2, 2016
12,417 views
a graph with n vertices and n-1 edges that is not a tree is called
User Avatar
1 votes
1 votes
1 answer
2
Sahil Gupta asked Dec 16, 2014
631 views
Prove that maximam number of edges in a planer graph with n vertices is 3n-6
User Avatar
0 votes
0 votes
2 answers
3
yuuchan asked Jul 22, 2023
534 views
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
User Avatar
0 votes
0 votes
1 answer
4
S Harika asked Mar 29, 2017
1,706 views
Suppose a graph G with n vertices is isomorphic to its complement.How many edges does G have?
User Avatar
Link Copied!