This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed. Results concerning the case when not all, but just some longest paths or cycles are intersected, for example two or three of them, are also reported.

No abstract

No abstract

The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs to study the different physical and chemical aspects of a chemical compound. In mathematical graph theory, chemical compounds are transformed in a unique mathematical representation and then examined under various parameters for these purposes. The Partition Dimension is also one of these parametric tools, which are used to identify each atom or vertex of a chemical structure under some chosen conditions. In the present paper, we use this tool to show the unique identification of each atom of a tri-hexagonal lattice of the α-boron nanotube.INDEX TERMS α-boron nanotube, tri-hexagonal boron nanotube, molecular graph, resolving partition set, partition dimension.

No abstract