On traceable and upper traceable numbers of graphs.

MaRDI QIDQ2828858zbMATH OpenFDO

Authors Futaba Fujie

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian graphtraceable graphtraceable numberupper traceable number

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Review text

For a connected graph \(G\) of order \(n\) at least 2 and a linear ordering \(s\) of the vertices of \(G\), \(d(s)\) is defined to be the sum of the distances between consecutive vertices of \(s\). The traceable number \(t(G)\) and the upper traceable number \(T(G)\) are defined to be the minimum and maximum, respectively, of these numbers \(d(s)\) over all linear orderings \(s\) of the vertices of \(G\). Then, for example, \(t(G)=n-1\) means that \(G\) contains a Hamiltonian path. The author investigates two realization questions for possible values of \(t(G)\) and \(T(G)\).

Recommendations

• The upper traceable number of a graph
• A note on bounds for the maximum traceable number of a graph.
• On upper traceable numbers of graphs
• Measures of traceability in graphs
• scientific article; zbMATH DE number 5237274

Cited in

(7)

• On traceable powers of digraphs
• A note on bounds for the maximum traceable number of a graph.
• On upper traceable numbers of graphs
• Measures of traceability in graphs
• The upper traceable number of a graph
• scientific article; zbMATH DE number 3920506 (Why is no real title available?)
• scientific article; zbMATH DE number 5237274 (Why is no real title available?)

This page was built for publication: On traceable and upper traceable numbers of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828858)