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.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:6469 |
| Date | January 2009 |
| Creators | Ostermeier, Philipp-Jens, Hellmuth, Marc, Klemm, Konstantin, Leydold, Josef, Stadler, Peter F. |
| Publisher | DMFA Slovenije |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Rights | Creative Commons: Attribution 3.0 Austria |
| Relation | http://amc.imfm.si/index.php/amc/article/viewFile/104/80, https://www.dmfa.si/, https://amc-journal.eu/index.php/amc/index, https://amc-journal.eu/index.php/amc/about/submissions#copyrightNotice, http://epub.wu.ac.at/6469/ |
Page generated in 0.0016 seconds