Awesome q2a theme
0 votes
How to know that a simple graph with given degree sequence {3,3,3,3,3,3,6}  is hamiltonian or not.
in Graph Theory by (117 points) | 33 views
It's your self doubt so I think you've already tried. So I have a doubt if my own that are there more than 1 non-isomorphic graphs of the degree set given?
No utkarsh , this was the statement of one of the question of test series of applied course.
Yes you are right @Shaik Masthan sorry for the wrong answer

As Mk said, more than one non-isomorphic graphs are possible with the given degree sequence.

Please log in or register to answer this question.

Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jan 2020
  1. shashin

    1163 Points

  2. Vimal Patel

    306 Points

  3. Deepakk Poonia (Dee)

    305 Points

  4. Debapaul

    237 Points

  5. Satbir

    192 Points

  6. SuvasishDutta

    137 Points

  7. Pratyush Priyam Kuan

    118 Points

  8. tp21

    108 Points

  9. DukeThunders

    96 Points

  10. pranay562

    95 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,989 questions
1,509 answers
89,814 users