Searcharxiv⌕ Search

arXiv subjects

Renata R. Del-Vecchio

Publications and source records attributed to Renata R. Del-Vecchio.

2 recordsLinked to original sources

The determinant of the distance matrix of graphs with at most two cycles

Let $G$ be a connected graph on $n$ vertices and $D(G)$ its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known when the graph is either a tree or {a} unicyclic graph. In this work we generalize these results, obtaining the determinant of the distance matrix for {all graphs} in a {class, including trees, unicyclic and bicyclic graphs. This class actually includes graphs with many cycles, provided that each block of the graph is at most bicyclic.}

math.CO↗

Cograph generation with linear delay

Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cographs with $n$ vertices, based on the generation of cotrees. The delay of our algorithm (time spent between two consecutive outputs) is $O(n)$. The time needed to generate the first output is also $O(n)$, which gives an overall $O(n\,M_n)$ time complexity, where $M_n$ is the number of unlabeled cographs with $n$ vertices. The algorithm avoids the generation of duplicates (isomorphic outputs) and produces, as a by-product, a linear ordering of unlabeled cographs wih $n$ vertices.

cs.DM↗