Defining the connectivity of a graph
$begingroup$
Consider a simple binary undirected graph, which adjacency matrix is $A = {a_{i,j}} in {0, 1}^{N times N}.$
Suppose that all vertices of such graph have at least one neighbors, i.e.
$$k_i = sum_{j=1}^N{a_{i,j}} geq 1.$$
How do we call this graph?
Reading the definition of connectivity, I did not find anything about this particular case.
I would say that it is "minimally connected".
Is there a proper nomenclature for these graphs?
graph-theory network
$endgroup$
add a comment |
$begingroup$
Consider a simple binary undirected graph, which adjacency matrix is $A = {a_{i,j}} in {0, 1}^{N times N}.$
Suppose that all vertices of such graph have at least one neighbors, i.e.
$$k_i = sum_{j=1}^N{a_{i,j}} geq 1.$$
How do we call this graph?
Reading the definition of connectivity, I did not find anything about this particular case.
I would say that it is "minimally connected".
Is there a proper nomenclature for these graphs?
graph-theory network
$endgroup$
$begingroup$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
1
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
$begingroup$
Consider a simple binary undirected graph, which adjacency matrix is $A = {a_{i,j}} in {0, 1}^{N times N}.$
Suppose that all vertices of such graph have at least one neighbors, i.e.
$$k_i = sum_{j=1}^N{a_{i,j}} geq 1.$$
How do we call this graph?
Reading the definition of connectivity, I did not find anything about this particular case.
I would say that it is "minimally connected".
Is there a proper nomenclature for these graphs?
graph-theory network
$endgroup$
Consider a simple binary undirected graph, which adjacency matrix is $A = {a_{i,j}} in {0, 1}^{N times N}.$
Suppose that all vertices of such graph have at least one neighbors, i.e.
$$k_i = sum_{j=1}^N{a_{i,j}} geq 1.$$
How do we call this graph?
Reading the definition of connectivity, I did not find anything about this particular case.
I would say that it is "minimally connected".
Is there a proper nomenclature for these graphs?
graph-theory network
graph-theory network
asked Dec 7 '18 at 19:22
the_candymanthe_candyman
8,84632045
8,84632045
$begingroup$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
1
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
$begingroup$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
1
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
$begingroup$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
$begingroup$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
1
1
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Requiring that every vertex have positive degree is not sufficient to make the graph connected. You may describe your graph as having no isolated vertices.
$endgroup$
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
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%2f3030273%2fdefining-the-connectivity-of-a-graph%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$
Requiring that every vertex have positive degree is not sufficient to make the graph connected. You may describe your graph as having no isolated vertices.
$endgroup$
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
$begingroup$
Requiring that every vertex have positive degree is not sufficient to make the graph connected. You may describe your graph as having no isolated vertices.
$endgroup$
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
$begingroup$
Requiring that every vertex have positive degree is not sufficient to make the graph connected. You may describe your graph as having no isolated vertices.
$endgroup$
Requiring that every vertex have positive degree is not sufficient to make the graph connected. You may describe your graph as having no isolated vertices.
answered Dec 7 '18 at 19:28
Zach LangleyZach Langley
9731019
9731019
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
add a comment |
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
$begingroup$
this makes sense. thanks a lot.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42
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%2f3030273%2fdefining-the-connectivity-of-a-graph%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$
What is a "binary" graph?
$endgroup$
– richarddedekind
Dec 8 '18 at 3:41
1
$begingroup$
Binary stands for "non-weighted", i.e. the entries of $A$ are in the set ${0, 1}$, not in $mathbb{R}^+$.
$endgroup$
– the_candyman
Dec 8 '18 at 11:42