Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/110377
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mestre, Ângela | - |
dc.date.accessioned | 2023-11-21T10:36:52Z | - |
dc.date.available | 2023-11-21T10:36:52Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 1526-1719 | pt |
dc.identifier.uri | https://hdl.handle.net/10316/110377 | - |
dc.description.abstract | We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and e cient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequently to further classes of connected graphs, namely, 2-edge connected, simple and loopless graphs. Our method con- sists of basic graph transformations only. | pt |
dc.language.iso | eng | pt |
dc.relation | Czech Ministry of Education, Youth and Sports within the project LC06002 | pt |
dc.rights | openAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt |
dc.title | Generating connected and 2-edge connected graphs | pt |
dc.type | article | - |
degois.publication.firstPage | 251 | pt |
degois.publication.lastPage | 281 | pt |
degois.publication.issue | 2 | pt |
degois.publication.title | Journal of Graph Algorithms and Applications | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.7155/jgaa.00187 | pt |
degois.publication.volume | 13 | pt |
dc.date.embargo | 2009-01-01 | * |
uc.date.periodoEmbargo | 0 | pt |
item.openairetype | article | - |
item.fulltext | Com Texto completo | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | FCTUC Física - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Generating connected and 2-edge connected graphs.pdf | 602.41 kB | Adobe PDF | View/Open |
Page view(s)
27
checked on Jul 17, 2024
Download(s)
21
checked on Jul 17, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License