Is there a math term for a modificated minimum spanning tree?
I have found a minimum spanning tree (left figure).
Then I have applied some modification:
- The edge
A-B(red) was added, - The edge
C-D(green) was rewritten toC'-D.
Edit. I don't delete the vertices.
- Steps 1-2 can be repeated more that one time for different edges.
Question. Is there a math term for an obtained graph (right figure)?
graph-theory notation terminology
asked Dec 4 '18 at 2:47
Nick
301112
add a comment |
I have found a minimum spanning tree (left figure).
Then I have applied some modification:
- The edge
A-B(red) was added, - The edge
C-D(green) was rewritten toC'-D.
Edit. I don't delete the vertices.
- Steps 1-2 can be repeated more that one time for different edges.
Question. Is there a math term for an obtained graph (right figure)?
graph-theory notation terminology
asked Dec 4 '18 at 2:47
Nick
301112
add a comment |
I have found a minimum spanning tree (left figure).
Then I have applied some modification:
- The edge
A-B(red) was added, - The edge
C-D(green) was rewritten toC'-D.
Edit. I don't delete the vertices.
- Steps 1-2 can be repeated more that one time for different edges.
Question. Is there a math term for an obtained graph (right figure)?
graph-theory notation terminology
asked Dec 4 '18 at 2:47
Nick
301112
I have found a minimum spanning tree (left figure).
Then I have applied some modification:
- The edge
A-B(red) was added, - The edge
C-D(green) was rewritten toC'-D.
Edit. I don't delete the vertices.
- Steps 1-2 can be repeated more that one time for different edges.
Question. Is there a math term for an obtained graph (right figure)?
graph-theory notation terminology
graph-theory notation terminology
asked Dec 4 '18 at 2:47
Nick
301112
asked Dec 4 '18 at 2:47
Nick
301112
edited Dec 4 '18 at 15:35
asked Dec 4 '18 at 2:47
Nick
301112
asked Dec 4 '18 at 2:47
Nick
301112
asked Dec 4 '18 at 2:47
Nick
301112
301112
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
Well...it's no longer a tree, so I guess the best I can say is that it's a spanning subgraph. I'm not sure whether your "modifications" always preserve the property that the new graph contains all the vertices. If not, then you can just say "it's a subgraph."
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
add a comment |
There is a term for this subgraph with a unique cycle: it is a $1$-tree.
Some authors also call it a pseudotree.
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
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%2f3025058%2fis-there-a-math-term-for-a-modificated-minimum-spanning-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
Well...it's no longer a tree, so I guess the best I can say is that it's a spanning subgraph. I'm not sure whether your "modifications" always preserve the property that the new graph contains all the vertices. If not, then you can just say "it's a subgraph."
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
add a comment |
Well...it's no longer a tree, so I guess the best I can say is that it's a spanning subgraph. I'm not sure whether your "modifications" always preserve the property that the new graph contains all the vertices. If not, then you can just say "it's a subgraph."
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
add a comment |
Well...it's no longer a tree, so I guess the best I can say is that it's a spanning subgraph. I'm not sure whether your "modifications" always preserve the property that the new graph contains all the vertices. If not, then you can just say "it's a subgraph."
Well...it's no longer a tree, so I guess the best I can say is that it's a spanning subgraph. I'm not sure whether your "modifications" always preserve the property that the new graph contains all the vertices. If not, then you can just say "it's a subgraph."
answered Dec 4 '18 at 2:54
community wiki
John Hughes
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
add a comment |
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
I don't delete the vertices.
– Nick
Dec 4 '18 at 2:56
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
It is more than a subgraph : it is a $1$-tree.
– Kuifje
Dec 4 '18 at 8:48
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
In view of Nick's comment on your answer: I don't think it is a 1-tree. :) It's tough to know without a description of all possible "modifications."
– John Hughes
Dec 4 '18 at 12:22
add a comment |
There is a term for this subgraph with a unique cycle: it is a $1$-tree.
Some authors also call it a pseudotree.
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
add a comment |
There is a term for this subgraph with a unique cycle: it is a $1$-tree.
Some authors also call it a pseudotree.
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
add a comment |
There is a term for this subgraph with a unique cycle: it is a $1$-tree.
Some authors also call it a pseudotree.
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
There is a term for this subgraph with a unique cycle: it is a $1$-tree.
Some authors also call it a pseudotree.
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
edited Dec 4 '18 at 8:47
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
answered Dec 4 '18 at 8:40
Kuifje
7,1082725
7,1082725
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
add a comment |
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
In my case I can add more than one cycle.
– Nick
Dec 4 '18 at 10:52
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3025058%2fis-there-a-math-term-for-a-modificated-minimum-spanning-tree%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
