Publication: The upper traceable number of a graph
| dc.contributor.author | Okamoto F. | |
| dc.contributor.author | Zhang P. | |
| dc.contributor.author | Saenpholphat V. | |
| dc.date.accessioned | 2021-04-05T04:32:02Z | |
| dc.date.available | 2021-04-05T04:32:02Z | |
| dc.date.issued | 2008 | |
| dc.date.issuedBE | 2551 | |
| dc.description.abstract | For a nontrivial connected graph G of order n and a linear ordering s: v1, v2,...,vn of vertices of G, define d(s) = ∑i=1n-1d(vi,vi+1). The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t+(G) of G is t+(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t+(G) - t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. © 2008 Mathematical Institute, Academy of Sciences of Czech Republic. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Czechoslovak Mathematical Journal. Vol 58, No.1 (2008), p.271-287 | |
| dc.identifier.doi | 10.1007/s10587-008-0016-9 | |
| dc.identifier.issn | 114642 | |
| dc.identifier.other | 2-s2.0-44349154184 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14740/4113 | |
| dc.rights.holder | มหาวิทยาลัยศรีนครินทรวิโรฒ | |
| dc.title | The upper traceable number of a graph | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| swu.datasource.scopus | https://www.scopus.com/inward/record.uri?eid=2-s2.0-44349154184&doi=10.1007%2fs10587-008-0016-9&partnerID=40&md5=7e0038c0b43889d07e66d1f42bfc6101 |