# Tagged Questions

42 views

### Algebraic Combinatorics about a Finite Graph

Here is a problem listed on a book 'Algebraic Combinatorics' by Richard P.Stanley. Let $G$ be a finite graph with at least two vertices. Suppose that for some $l \ge 1$, the number of walks of ...
20 views

### Compute paths through graph vertex

I have a mesh, in which every vertex has most likely 6 to 8 neighbours. I need to compute like on the picture. For vertex O there are three incoming vertices: A, B and C. And we have these paths: AC, ...
18 views

### Irreducible matrices and connected graphs

The adjacency matrix of a simple undirected graph is irreducible if and only if the graph is connected. Here my questions : Is there an efficient method to check whether a matrix is irreducible (I ...
35 views

### How to prove the equivalence of 2 affine spaces given that one is the subset of the other one?

For the sake of completeness, I would like to give you some concepts before asking the questions: For every simplex $S=<<x^{0},x^{1},...,x^{k}>>$ in $\Bbb R^{n}$, denote by $H_s$, the ...
32 views

### Graph pruning whilst ensuring connectivity

Problem: I have a graph (in this instance, it's represented by a matrix which is $\in \mathbb{R}^{n \times n}$). In the raw graph, all nodes are connected to every other node (except themselves) in ...
28 views

### Kronecker product and the vec operator: confusion on proof of vec(AXB) = (transpose(B) ⊗ A) vec(X)

I was reading up on Kronecker products and vec operator from couple of sources and landed on the equation: vec(AXB) = (transpose(B) ⊗ A) vec(X) suppose ...
67 views

### Finding the smallest max eigenvalues for related matrices?

While messing around with a spectral approach to a graph coloring question, I happened upon a type of problem I hadn't seen before. Suppose you have two symmetric $n$ x $n$ matrices in the form ...
40 views

### Existence of solution for matrix equation $(I - \alpha A) \bar{x}=\bar{b}$

This is my first question in here and I would be really thankful if someone could help me with understanding the matter. I am solving a matrix equation $(I-\alpha A) \bar{x} = \bar{b}$ for a positive ...
15 views

### Usefulness of Laplacians for directed graphs

Are laplacians for directed graphs used in any algorithms ? For example laplacians for the undirected graphs are used in algorithms such as spectral clustering.
368 views

57 views

### Find eigenvalues from a given relation.

This is a simple problem of linear algebra. One without knowing graph theory may solve it. I am missing a small easy logic. Description: Let $G$ be a graph with $n$ vertices and $G^c$ is its ...
58 views

### Proof Technique: Linear Independence - What makes the technique work in general?

Reading the book on Graph theory written by Bondy and Murty (Springer), they present the following proof technique (Linear Indepence) to use when the combinatorial approach fail. My questions are: ...
36 views

### Computing an element of Moore-Penrose pseudoinverse of a large sparse matrix

I am computing resistance between two points in a network. To do this I compute the Laplace matrix and then take a Moore-Penrose pseudoinverse. However, I am really only interested in the resistance ...
61 views

### Prove that the minimum of row sums of a nonnegative symmetric matrix is preserved

Let $A$ be an $n\times n$ adjacency (nonnegative, irreducible and symmetric) matrix with zeros on the diagonal. Denote $i$-th row sum of $A^k$ as $r^{(k)}_i$, where $k\geq1$. I want to prove that if ...
43 views

### psittacism: Fundamental Theory of Time

This question is in reference to the programming question found here. What method of approach should I be thinking of if I have a list of lectures A, B, and C, and discussions D, E, and F, that are ...
If I have $A$ the adjacency of a strongly connected digraph, I want to show: For $\lambda$ satisfying $Ae= \lambda e$ for nonegative $e$, I want to show for any eigenvector (could be negative), the ...