Is there any way to find out total number of simple graphs of given sequence?
$begingroup$
This problem came randomly to my mind while studying graph theory.Suppose 3,3,3,3,3,3 is a given sequence of degree of vertices of a graph.We know one of its graph is a hexagon with opposite diagonals attached.But suppose any arbitrary sequence is given and suppose it is guaranteed that it's graph exists,then how to find all such graphs(I mean is there some algorithm or we have to find those graphs randomly).
discrete-mathematics graph-theory
asked Jan 16 at 17:42
MaheshMahesh
1937
$endgroup$
add a comment |
$begingroup$
This problem came randomly to my mind while studying graph theory.Suppose 3,3,3,3,3,3 is a given sequence of degree of vertices of a graph.We know one of its graph is a hexagon with opposite diagonals attached.But suppose any arbitrary sequence is given and suppose it is guaranteed that it's graph exists,then how to find all such graphs(I mean is there some algorithm or we have to find those graphs randomly).
discrete-mathematics graph-theory
asked Jan 16 at 17:42
MaheshMahesh
1937
$endgroup$
add a comment |
$begingroup$
This problem came randomly to my mind while studying graph theory.Suppose 3,3,3,3,3,3 is a given sequence of degree of vertices of a graph.We know one of its graph is a hexagon with opposite diagonals attached.But suppose any arbitrary sequence is given and suppose it is guaranteed that it's graph exists,then how to find all such graphs(I mean is there some algorithm or we have to find those graphs randomly).
discrete-mathematics graph-theory
asked Jan 16 at 17:42
MaheshMahesh
1937
$endgroup$
This problem came randomly to my mind while studying graph theory.Suppose 3,3,3,3,3,3 is a given sequence of degree of vertices of a graph.We know one of its graph is a hexagon with opposite diagonals attached.But suppose any arbitrary sequence is given and suppose it is guaranteed that it's graph exists,then how to find all such graphs(I mean is there some algorithm or we have to find those graphs randomly).
discrete-mathematics graph-theory
discrete-mathematics graph-theory
asked Jan 16 at 17:42
MaheshMahesh
1937
asked Jan 16 at 17:42
MaheshMahesh
1937
asked Jan 16 at 17:42
MaheshMahesh
1937
asked Jan 16 at 17:42
MaheshMahesh
1937
asked Jan 16 at 17:42
MaheshMahesh
1937
1937
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can indeed. There is a paper on it here :
Zoltán Király "Recognizing graphic degree sequences and generating all realizations"
Note that this approach will list multiple isomorphic copies of the graphs for a sequence - that is, it is redundant - but it will list them all (it is exhaustive).
With thanks to Peter Erdos, who pointed me to this paper.
answered Jan 17 at 0:02
gilleaingilleain
9311714
$endgroup$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076042%2fis-there-any-way-to-find-out-total-number-of-simple-graphs-of-given-sequence%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
$begingroup$
You can indeed. There is a paper on it here :
Zoltán Király "Recognizing graphic degree sequences and generating all realizations"
Note that this approach will list multiple isomorphic copies of the graphs for a sequence - that is, it is redundant - but it will list them all (it is exhaustive).
With thanks to Peter Erdos, who pointed me to this paper.
answered Jan 17 at 0:02
gilleaingilleain
9311714
$endgroup$
add a comment |
$begingroup$
You can indeed. There is a paper on it here :
Zoltán Király "Recognizing graphic degree sequences and generating all realizations"
Note that this approach will list multiple isomorphic copies of the graphs for a sequence - that is, it is redundant - but it will list them all (it is exhaustive).
With thanks to Peter Erdos, who pointed me to this paper.
answered Jan 17 at 0:02
gilleaingilleain
9311714
$endgroup$
add a comment |
$begingroup$
You can indeed. There is a paper on it here :
Zoltán Király "Recognizing graphic degree sequences and generating all realizations"
Note that this approach will list multiple isomorphic copies of the graphs for a sequence - that is, it is redundant - but it will list them all (it is exhaustive).
With thanks to Peter Erdos, who pointed me to this paper.
answered Jan 17 at 0:02
gilleaingilleain
9311714
$endgroup$
You can indeed. There is a paper on it here :
Zoltán Király "Recognizing graphic degree sequences and generating all realizations"
Note that this approach will list multiple isomorphic copies of the graphs for a sequence - that is, it is redundant - but it will list them all (it is exhaustive).
With thanks to Peter Erdos, who pointed me to this paper.
answered Jan 17 at 0:02
gilleaingilleain
9311714
answered Jan 17 at 0:02
gilleaingilleain
9311714
answered Jan 17 at 0:02
gilleaingilleain
9311714
answered Jan 17 at 0:02
gilleaingilleain
9311714
9311714
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076042%2fis-there-any-way-to-find-out-total-number-of-simple-graphs-of-given-sequence%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
