Publication:
The upper traceable number of a graph

0
0

Issued Date

2008

Resource Type

Article

File Type

application/pdf

ISSN

114642

DOI

10.1007/s10587-008-0016-9

Other identifier(s)

2-s2.0-44349154184

Rights Holder(s)

มหาวิทยาลัยศรีนครินทรวิโรฒ

Bibliographic Citation

Czechoslovak Mathematical Journal. Vol 58, No.1 (2008), p.271-287

Suggested Citation

Okamoto F., Zhang P., Saenpholphat V. The upper traceable number of a graph. Czechoslovak Mathematical Journal. Vol 58, No.1 (2008), p.271-287. doi:10.1007/s10587-008-0016-9 Retrieved from: https://hdl.handle.net/20.500.14740/4113

Title

The upper traceable number of a graph

Author(s)

Okamoto F.
 Zhang P.
 Saenpholphat V.

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.

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/4113

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By