Artykuł  

Extremal traceable graphs with non-traceable edges

creativeworkseries.issn1232-9274
dc.contributor.authorWojda, Adam Paweł.
dc.date.issued2009
dc.description.abstractBy NT(n) we denote the set of graphs of order n which are traceable but have non-traceable edges, i.e. edges which are not contained in any hamiltonian path. The class NT(re) has been considered by Balińska and co-authors in a paper published in 2003, where it was proved that the maximum size t(max)(n) of a graph in NT(n) is at least (n2-5n+14)/2 (for n? 12). The authors also found t(max)(n) for 5 ? n ? 11. We prove that, for n n? 5, t(max) (n) = max {(n-2/2) + 4, [formula] and, moreover, we characterize the extremal graphs (in fact we prove that these graphs are exactly those already described in the paper by Balińska et al). We also prove that a traceable graph of order n n? 5 may have at most [n-3/2] [n-3/2] non traceable edges (this result was conjectured in the mentioned paper by Balińska and co-authors).en
dc.description.versionwersja wydawnicza
dc.identifier.eissn2300-6919
dc.identifier.issn1232-9274
dc.identifier.nukatdd2009318064
dc.identifier.urihttps://repo.agh.edu.pl/handle/AGH/50104
dc.language.isoeng
dc.rightsAttribution 4.0 International
dc.rights.accessotwarty dostęp
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.subjecttraceable graphen
dc.subjectnon-traceable edgeen
dc.titleExtremal traceable graphs with non-traceable edgesen
dc.title.relatedOpuscula Mathematica
dc.typeartykuł
dspace.entity.typePublication
publicationissue.issueNumberNo. 1
publicationissue.paginationpp. 89-92
publicationvolume.volumeNumberVol. 29
relation.isJournalIssueOfPublicationf1fe7ce8-8d89-46cc-b797-447d94992b06
relation.isJournalIssueOfPublication.latestForDiscoveryf1fe7ce8-8d89-46cc-b797-447d94992b06
relation.isJournalOfPublication304b3b9b-59b9-4830-9178-93a77e6afbc7
Pliki
Pakiet podstawowy
Teraz pokazywane1 - 1 z 1
Ładuję...
Miniatura
Nazwa:
29-1-08.pdf
Rozmiar:
266.94 KB
Format:
Adobe Portable Document Format
Opis:
Artykuł z czasopisma