How to Calculate No of Simple graph with labelled vertices?

yg92 asked Feb 5, 2017 • recategorized Jul 6, 2022 by Lakshman Bhaiya

451 views

0 votes

No of Simple Undirected Graph with unablled vertices - 2^nC2

No of Simple Undirected Graph with labelled vertices - ?

No of Simple Undirected Connected Graph with unablled vertices - ?

No of Simple Undirected Connected Graph with labelled vertices - ?

Programming in C
graph-theory
graph-algorithms
data-structures
algorithms
combinatory

+ –

yg92 asked Feb 5, 2017 • recategorized Jul 6, 2022 by Lakshman Bhaiya

yg92

451 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

0 answers

Ayush Upadhyaya asked Jun 6, 2018

2,362 views

Number of distinct cycles of length 4 in a complete graph of 6 labelled vertices.
This is in reference to the below question https://gateoverflow.in/473/gate2012-38 My doubt here is In this question, we can also solve like first we select 4 vertices out of 6 in 6C4 ways. Now we need to count ... evaluates to 3 in case of n=4.So by multiplication rule, total cycles we have 45.Is this way correct?

This is in reference to the below questionhttps://gateoverflow.in/473/gate2012-38My doubt here isIn this question, we can also solve like first we select 4 vertices out o...

Ayush Upadhyaya

2.4k views

Ayush Upadhyaya asked Jun 6, 2018

Graph Theory
graph-theory
engineering-mathematics

+ –

0 votes

0 answers

iarnav asked Apr 19, 2018

417 views

#Algorithms How many cuts are possible are in a graph with n nodes?
Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?

Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?

iarnav

417 views

iarnav asked Apr 19, 2018

Algorithms
graph-theory
algorithms
graph-algorithms
minimum-spanning-tree

+ –

0 votes

0 answers

iarnav asked May 13, 2018

414 views

#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time, but I can't be able find that algorithm. Someone please share that.

I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time...

iarnav

414 views

iarnav asked May 13, 2018

Algorithms
graph-theory
algorithms
depth-first-search
graph-algorithms

+ –

0 votes

1 answer

adarsh shivhare asked Dec 30, 2017

2,671 views

no of simple graph possible with 6 vertices and 4 edges is ?

adarsh shivhare

2.7k views

adarsh shivhare asked Dec 30, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0