Computing the distance matrix from an adjacency matrixConnected graph, each power of adjacency matrix has zerosChecking connectivity of adjacency matrixAdjacency matrix and connectivity proofMultiplication of adjacency matrix of two graphsIs there a method to measure the similarity between undirected graph vertices?Prove that the graph is connectedAdjacency matrix graphs and symmetryCan any integer matrix be thought of as the adjacency matrix of a digraph?Compute adjacency matrix from shortest distance matrixAre all adjacency matrices of connected graph diagonalizable?
Why isn't KTEX's runway designation 10/28 instead of 9/27?
Why are on-board computers allowed to change controls without notifying the pilots?
Golf game boilerplate
The most efficient algorithm to find all possible integer pairs which sum to a given integer
How to check participants in at events?
I2C signal and power over long range (10meter cable)
Can a Bard use an arcane focus?
Can I use my Chinese passport to enter China after I acquired another citizenship?
"lassen" in meaning "sich fassen"
How to deal with or prevent idle in the test team?
How do I rename a LINUX host without needing to reboot for the rename to take effect?
Is there an Impartial Brexit Deal comparison site?
Superhero words!
Simulating a probability of 1 of 2^N with less than N random bits
What do you call the infoboxes with text and sometimes images on the side of a page we find in textbooks?
Should my PhD thesis be submitted under my legal name?
Why is delta-v is the most useful quantity for planning space travel?
Bob has never been a M before
Indicating multiple different modes of speech (fantasy language or telepathy)
What was required to accept "troll"?
What if somebody invests in my application?
Simple image editor tool to draw a simple box/rectangle in an existing image
My boss asked me to take a one-day class, then signs it up as a day off
No idea how to draw this using tikz
Computing the distance matrix from an adjacency matrix
Connected graph, each power of adjacency matrix has zerosChecking connectivity of adjacency matrixAdjacency matrix and connectivity proofMultiplication of adjacency matrix of two graphsIs there a method to measure the similarity between undirected graph vertices?Prove that the graph is connectedAdjacency matrix graphs and symmetryCan any integer matrix be thought of as the adjacency matrix of a digraph?Compute adjacency matrix from shortest distance matrixAre all adjacency matrices of connected graph diagonalizable?
$begingroup$
How do I do this?
I know how to compute each matrix from a given graph but don't know how to get from one to the other and what the link between the two matrices are.
PS: for graphs that are undirected, connected and simple
matrices discrete-mathematics graph-theory network
asked Mar 16 at 23:30
SS007SS007
62
$endgroup$
add a comment |
$begingroup$
How do I do this?
I know how to compute each matrix from a given graph but don't know how to get from one to the other and what the link between the two matrices are.
PS: for graphs that are undirected, connected and simple
matrices discrete-mathematics graph-theory network
asked Mar 16 at 23:30
SS007SS007
62
$endgroup$
1
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35
add a comment |
$begingroup$
How do I do this?
I know how to compute each matrix from a given graph but don't know how to get from one to the other and what the link between the two matrices are.
PS: for graphs that are undirected, connected and simple
matrices discrete-mathematics graph-theory network
asked Mar 16 at 23:30
SS007SS007
62
$endgroup$
How do I do this?
I know how to compute each matrix from a given graph but don't know how to get from one to the other and what the link between the two matrices are.
PS: for graphs that are undirected, connected and simple
matrices discrete-mathematics graph-theory network
matrices discrete-mathematics graph-theory network
asked Mar 16 at 23:30
SS007SS007
62
asked Mar 16 at 23:30
SS007SS007
62
asked Mar 16 at 23:30
SS007SS007
62
asked Mar 16 at 23:30
SS007SS007
62
asked Mar 16 at 23:30
SS007SS007
62
62
1
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35
add a comment |
1
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35
1
1
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35
add a comment |
0
active
oldest
votes
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%2f3150980%2fcomputing-the-distance-matrix-from-an-adjacency-matrix%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3150980%2fcomputing-the-distance-matrix-from-an-adjacency-matrix%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
1
$begingroup$
You need to exponentiate the adjacency matrix to a high enough power in the min-plus algebra. This is, instead of adding you take minimum and instead of multiplying you take a sum. This computation is actually the same as what you do what you 'compute it directly from the graph'.
$endgroup$
– user647486
Mar 16 at 23:35