About 43,900 results
Open links in new tab
  1. How to identify bipartite graph from Adjacency matrix?

    Dec 8, 2017 · If the matrix is now in the canonical form of a bipartite adjacency matrix (where the upper-left and lower-right blocks are all zero), the graph is bipartite; quit and return …

  2. Finding path-lengths by the power of Adjacency matrix of an …

    Aug 13, 2016 · Finding path-lengths by the power of Adjacency matrix of an undirected graph Ask Question Asked 9 years, 4 months ago Modified 4 years ago

  3. Example for adjacency matrix of a bipartite graph

    Jan 24, 2016 · Can someone explain to me with an example how to create the adjacency matrix of a bipartite graph? And why the diagonal elements of it are not zero? Thanks.

  4. graph theory - Node ordering permutation based adjacency …

    Sep 9, 2018 · I was reading a research paper where I came across this definition of an adjacency matrix based on a node ordering function. I am a beginner in graph theory hence was not able …

  5. Characteristic polynomials of graphs - Mathematics Stack Exchange

    Feb 22, 2025 · 2 I have $2$ questions about how to find the characteristic polynomial of some graphs. If $G$ is a simple cycle with $n$ vertices and $n$ edges, $C_n$, I need to find the …

  6. Isomorphism of two graphs using adjacency matrix

    Jun 3, 2016 · Observe the to graphs, From G1, G2 can be obtained if the first line and second line of the graph G1 are interchanged. So, this graph is definitely iso-"morphic". (bijective and …

  7. Easiest way to determine all disconnected sets from a graph?

    4 Say you have an adjacency matrix like the one in your question. You can determine connected components by doing a breadth-first (or depth-first) search in the matrix without having to …

  8. Number of $k$-cycles from an adjacency matrix of a graph

    Dec 19, 2021 · Explore related questions matrices graph-theory algebraic-graph-theory adjacency-matrix

  9. Adjacency Matrix of Connected Bipartite Graph

    Dec 19, 2024 · If I have a connected bipartite graph with 2 and 3 nodes respectively represented by the adjacency matrix $$ A (2,3) = \begin {bmatrix} 0 & 0 & 1 & 1 & 1 \\ 0 & 0 & 1 & 1 ...

  10. How can one justify if the graph is planar from adjacency matrix?

    Feb 10, 2021 · 2 There are some simple conditions which, if transgressed, would mean that the graph is non-planar but in general there is nothing which could easily determine whether the …