Simple Graph with 5 vertices of degrees 2, 3, 3, 3, 5












0












$begingroup$


I'm taking a class in Discrete Mathematics, and one of the problems in my homework asks for a Simple Graph with 5 vertices of degrees 2, 3, 3, 3, and 5. How can I have more than 4 edges? I'm really confused, maybe I don't really understand what a "Simple Graph" means.










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you think the definition of "simple graph" is?
    $endgroup$
    – Randall
    Dec 3 '18 at 2:33










  • $begingroup$
    Has no loops, no multi-edges.
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:34










  • $begingroup$
    Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
    $endgroup$
    – Boshu
    Dec 3 '18 at 2:36










  • $begingroup$
    Since there are $5$ vertices, no vertex can have degree more than $4$.
    $endgroup$
    – the_fox
    Dec 3 '18 at 2:36










  • $begingroup$
    Looks like professor made a typo then
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:36
















0












$begingroup$


I'm taking a class in Discrete Mathematics, and one of the problems in my homework asks for a Simple Graph with 5 vertices of degrees 2, 3, 3, 3, and 5. How can I have more than 4 edges? I'm really confused, maybe I don't really understand what a "Simple Graph" means.










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you think the definition of "simple graph" is?
    $endgroup$
    – Randall
    Dec 3 '18 at 2:33










  • $begingroup$
    Has no loops, no multi-edges.
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:34










  • $begingroup$
    Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
    $endgroup$
    – Boshu
    Dec 3 '18 at 2:36










  • $begingroup$
    Since there are $5$ vertices, no vertex can have degree more than $4$.
    $endgroup$
    – the_fox
    Dec 3 '18 at 2:36










  • $begingroup$
    Looks like professor made a typo then
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:36














0












0








0





$begingroup$


I'm taking a class in Discrete Mathematics, and one of the problems in my homework asks for a Simple Graph with 5 vertices of degrees 2, 3, 3, 3, and 5. How can I have more than 4 edges? I'm really confused, maybe I don't really understand what a "Simple Graph" means.










share|cite|improve this question









$endgroup$




I'm taking a class in Discrete Mathematics, and one of the problems in my homework asks for a Simple Graph with 5 vertices of degrees 2, 3, 3, 3, and 5. How can I have more than 4 edges? I'm really confused, maybe I don't really understand what a "Simple Graph" means.







discrete-mathematics graph-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 3 '18 at 2:32









Ayaan SiddiquiAyaan Siddiqui

11




11












  • $begingroup$
    What do you think the definition of "simple graph" is?
    $endgroup$
    – Randall
    Dec 3 '18 at 2:33










  • $begingroup$
    Has no loops, no multi-edges.
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:34










  • $begingroup$
    Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
    $endgroup$
    – Boshu
    Dec 3 '18 at 2:36










  • $begingroup$
    Since there are $5$ vertices, no vertex can have degree more than $4$.
    $endgroup$
    – the_fox
    Dec 3 '18 at 2:36










  • $begingroup$
    Looks like professor made a typo then
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:36


















  • $begingroup$
    What do you think the definition of "simple graph" is?
    $endgroup$
    – Randall
    Dec 3 '18 at 2:33










  • $begingroup$
    Has no loops, no multi-edges.
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:34










  • $begingroup$
    Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
    $endgroup$
    – Boshu
    Dec 3 '18 at 2:36










  • $begingroup$
    Since there are $5$ vertices, no vertex can have degree more than $4$.
    $endgroup$
    – the_fox
    Dec 3 '18 at 2:36










  • $begingroup$
    Looks like professor made a typo then
    $endgroup$
    – Ayaan Siddiqui
    Dec 3 '18 at 2:36
















$begingroup$
What do you think the definition of "simple graph" is?
$endgroup$
– Randall
Dec 3 '18 at 2:33




$begingroup$
What do you think the definition of "simple graph" is?
$endgroup$
– Randall
Dec 3 '18 at 2:33












$begingroup$
Has no loops, no multi-edges.
$endgroup$
– Ayaan Siddiqui
Dec 3 '18 at 2:34




$begingroup$
Has no loops, no multi-edges.
$endgroup$
– Ayaan Siddiqui
Dec 3 '18 at 2:34












$begingroup$
Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
$endgroup$
– Boshu
Dec 3 '18 at 2:36




$begingroup$
Have you considered the fact that they might have intended for you to state that such a graph cannot exist?
$endgroup$
– Boshu
Dec 3 '18 at 2:36












$begingroup$
Since there are $5$ vertices, no vertex can have degree more than $4$.
$endgroup$
– the_fox
Dec 3 '18 at 2:36




$begingroup$
Since there are $5$ vertices, no vertex can have degree more than $4$.
$endgroup$
– the_fox
Dec 3 '18 at 2:36












$begingroup$
Looks like professor made a typo then
$endgroup$
– Ayaan Siddiqui
Dec 3 '18 at 2:36




$begingroup$
Looks like professor made a typo then
$endgroup$
– Ayaan Siddiqui
Dec 3 '18 at 2:36










1 Answer
1






active

oldest

votes


















1












$begingroup$

Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023534%2fsimple-graph-with-5-vertices-of-degrees-2-3-3-3-5%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.






        share|cite|improve this answer









        $endgroup$



        Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 3 '18 at 2:36









        gt6989bgt6989b

        34.2k22455




        34.2k22455






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023534%2fsimple-graph-with-5-vertices-of-degrees-2-3-3-3-5%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            ComboBox Display Member on multiple fields

            Is it possible to collect Nectar points via Trainline?