Graphs with given degree sequence and maximal spectral radius.
Minimal cycle bases of outerplanar graphs.
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences.
Interchangeability of relevant cycles in graphs.
Nodal domain theorems and bipartite subgraphs.
Circuit bases of strongly connected digraphs
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
Page 1