Quotation Ostermeier, Philipp-Jens, Hellmuth, Marc , Klemm, Konstantin , Leydold, Josef, Stadler, Peter F. . 2009. A note on quasi-robust cycle bases. Ars Mathematica Contemporanea 2 213-240.


RIS


BibTeX

Abstract

We investigate here some aspects of cycle bases of undirected graphs that allow the iterative construction of all elementary cycles. We introduce the concept of quasi-robust bases as a generalization of the notion of robust bases and demonstrate that a certain class of bases of the complete bipartite graphs K m,n with m,n ≥5 is quasi-robust but not robust. We furthermore disprove a conjecture for cycle bases of Cartesian product graphs.

Tags

Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation WU
Type of publication Journal article
Journal Ars Mathematica Contemporanea
Citation Index SCI
Language English
Title A note on quasi-robust cycle bases
Volume 2
Year 2009
Page from 213
Page to 240
URL http://amc.imfm.si/index.php/amc/article/viewFile/104/80

Associations

People
Leydold, Josef (Details)
External
Hellmuth, Marc (Max Planck Institute for Mathematics in the Sciences, Germany)
Klemm, Konstantin (Bioinformatics Group, Department of Computer Science, University of Leipzig, Germany)
Ostermeier, Philipp-Jens (Bioinformatics Group, Department of Computer Science, University of Leipzig, Germany)
Stadler, Peter F. (Bioinformatics Group, Department of Computer Science, Germany)
Organization
Institute for Statistics and Mathematics IN (Details)
Research Institute for Computational Methods FI (Details)
Google Scholar: Search