Register

graph theory(basic doubt)

1,494 views
1 1 vote
Q.1)How many nonisomorphic simple graph are there with 6 vertices and 4 edges??

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · counting(general dou...Next → · ACE Engineering acad...
← Previous in category · Planar GraphNext in category → · complete lattice and...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
BASANT KUMAR asked Oct 20, 2018
1,248 views
graph theory(basic doubt,kenneth rosen)
Q.1) for which value of n are these graph are bipartite??a)$C_{N}$ (cycle graph having "n" vertices)(b) $W_{N}$ (wheel graph having "n" vertices)
1 1 vote
1 1 answer
401
401 views
GO Classes asked Oct 16, 2024
401 views
GO Classes Test Series | Data Structures and Algorithms | Basic graph algorithms: traversals and Shortest path | Question: 11
For which of the following does there exist a simple undirected graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$ satisfying the specified conditions?$\text{G}$ has $3$ compone...
0 0 votes
1 1 answer
263
263 views
GO Classes asked Oct 16, 2024
263 views
GO Classes Test Series | Data Structures and Algorithms | Basic graph algorithms: traversals and Shortest path | Question: 14
A way to transform one undirected simple graph into another is by obtaining its subdivision. Intuitively, the subdivision of an undirected graph $\mathrm{G},$ denoted $\t...
0 0 votes
1 answers 1 answer
483
483 views
gagan55 asked Jun 30, 2023
483 views
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??