When we study graph factorization a lot of emphasis is placed on $k$-factorable graphs, i.e. graphs in which the factors are all $k$-regular. Why is such a factorization more important then say ...
I had the need to calculate the adjacency matrix $L$ of the line graph of a certain planar $k$-regular graphs $G(n,e)$ ( $n$ vertices and $e=\frac k2 n$ edges) given its adjacency matrix $A_G$. Here I ...