Rank-width is a graph parameter that measures the complexity of a graph in terms of linear algebraic properties. It is defined in terms of the ranks of the adjacency matrix of the graph. More formally, the rank-width of a graph \( G \) can be understood through a specific type of tree decomposition.
New to topics? Read the docs here!