How does one “join” two graphs in graph theory?
$begingroup$
I am asked to find the join of two graphs in graph theory. But I cannot find the exact definition! I know that in lattice theory, we join every vertex of a graph to every vertex of another graph to find the join of graphs. Any expert advice is welcome.
graph-theory definition
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
$endgroup$
add a comment |
$begingroup$
I am asked to find the join of two graphs in graph theory. But I cannot find the exact definition! I know that in lattice theory, we join every vertex of a graph to every vertex of another graph to find the join of graphs. Any expert advice is welcome.
graph-theory definition
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
$endgroup$
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22
add a comment |
$begingroup$
I am asked to find the join of two graphs in graph theory. But I cannot find the exact definition! I know that in lattice theory, we join every vertex of a graph to every vertex of another graph to find the join of graphs. Any expert advice is welcome.
graph-theory definition
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
$endgroup$
I am asked to find the join of two graphs in graph theory. But I cannot find the exact definition! I know that in lattice theory, we join every vertex of a graph to every vertex of another graph to find the join of graphs. Any expert advice is welcome.
graph-theory definition
graph-theory definition
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
edited Mar 10 '16 at 2:11
ForgotALot
3,6171816
3,6171816
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
asked Mar 10 '16 at 2:05
Kavita SahuKavita Sahu
13011
13011
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22
add a comment |
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The join of two graphs $G_1$ and $G_2$ , denoted by $G_1nabla G_2 $, is a
graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
$endgroup$
add a comment |
$begingroup$
A more Computer Science oriented solution: https://arxiv.org/pdf/1608.05594.pdf
answered Jun 15 '18 at 1:22
jackbjackb
1529
$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%2f1691013%2fhow-does-one-join-two-graphs-in-graph-theory%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
$begingroup$
The join of two graphs $G_1$ and $G_2$ , denoted by $G_1nabla G_2 $, is a
graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
$endgroup$
add a comment |
$begingroup$
The join of two graphs $G_1$ and $G_2$ , denoted by $G_1nabla G_2 $, is a
graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
$endgroup$
add a comment |
$begingroup$
The join of two graphs $G_1$ and $G_2$ , denoted by $G_1nabla G_2 $, is a
graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
$endgroup$
The join of two graphs $G_1$ and $G_2$ , denoted by $G_1nabla G_2 $, is a
graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
edited Dec 3 '18 at 5:37
epimorphic
2,74231533
2,74231533
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
answered May 3 '16 at 3:38
L S B. user255259L S B. user255259
30618
30618
add a comment |
add a comment |
$begingroup$
A more Computer Science oriented solution: https://arxiv.org/pdf/1608.05594.pdf
answered Jun 15 '18 at 1:22
jackbjackb
1529
$endgroup$
add a comment |
$begingroup$
A more Computer Science oriented solution: https://arxiv.org/pdf/1608.05594.pdf
answered Jun 15 '18 at 1:22
jackbjackb
1529
$endgroup$
add a comment |
$begingroup$
A more Computer Science oriented solution: https://arxiv.org/pdf/1608.05594.pdf
answered Jun 15 '18 at 1:22
jackbjackb
1529
$endgroup$
A more Computer Science oriented solution: https://arxiv.org/pdf/1608.05594.pdf
answered Jun 15 '18 at 1:22
jackbjackb
1529
answered Jun 15 '18 at 1:22
jackbjackb
1529
answered Jun 15 '18 at 1:22
jackbjackb
1529
answered Jun 15 '18 at 1:22
jackbjackb
1529
1529
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%2f1691013%2fhow-does-one-join-two-graphs-in-graph-theory%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
$begingroup$
perhaps providing the actual question would be helpful. Literally, the join is the "graph with all the edges that connect the vertices of the first graph with the vertices of the second graph."
$endgroup$
– Andres Mejia
Mar 10 '16 at 2:13
$begingroup$
Let me know that when we draw join of two graphs, is that I should join every vertex of graph1 to every vertex of graph 2 by an edge?
$endgroup$
– Kavita Sahu
Mar 10 '16 at 2:22