Skip to main content

All Questions

0 votes
1 answer
104 views

Finding path lengths by the power of adjacency matrix of an undirected graph

The same question was asked almost 7 years ago. It turned out to be a matter of terminology in different textbooks between the terms "path" and "walk". While the answers addressed ...
Moobie's user avatar
  • 103
4 votes
1 answer
2k views

Finding Euler path using powers of adjacency

Context: I'm studying an introductory course to Discrete Applied Mathematics, and am new to the context of graphs. Knowing that a graph can be represented as an adjacency matrix, say we have the ...
mazunki's user avatar
  • 155
1 vote
1 answer
116 views

Is the graph formed by GP series of adjacency matrix, Eulerian?

Suppose I have a Graph G(V,E) and A is the adjacency matrix of G. The graph thus formed by creating a GP series of adjacency matrix $P=A+A^2+A^3+....+A^{n-1}$ Is this graph Eulerian? A is such ...
Mahesh Ranjan's user avatar
2 votes
1 answer
2k views

How to find Eulerian path in the given graph?

I have plotted the following graph (was given by the adjacency matrix): And I have to find the Eulerian path there and emphase this. I am concerned because my book says that the further action ...
M.Mass's user avatar
  • 2,672